./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_fillercode_fillercodesize_ps-cn-10_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.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 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:50:34,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:50:34,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:50:34,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:50:34,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:50:34,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:50:34,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:50:34,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:50:34,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:50:34,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:50:34,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:50:34,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:50:34,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:50:34,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:50:34,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:50:34,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:50:34,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:50:34,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:50:34,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:50:34,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:50:34,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:50:34,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:50:34,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:50:34,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:50:34,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:50:34,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:50:34,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:50:34,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:50:34,406 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:50:34,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:50:34,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:50:34,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:50:34,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:34,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:50:34,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:50:34,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:50:34,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:50:34,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:50:34,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:50:34,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:50:34,410 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:50:34,410 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:50:34,410 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 -> 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 [2024-10-13 00:50:34,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:50:34,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:50:34,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:50:34,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:50:34,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:50:34,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2024-10-13 00:50:36,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:50:36,415 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:50:36,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2024-10-13 00:50:36,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0e62083/2683696845ee4abb81afc7a909bf6587/FLAGa9b9cb347 [2024-10-13 00:50:36,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f0e62083/2683696845ee4abb81afc7a909bf6587 [2024-10-13 00:50:36,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:50:36,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:50:36,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:36,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:50:36,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:50:36,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b831dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36, skipping insertion in model container [2024-10-13 00:50:36,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:50:36,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i[915,928] [2024-10-13 00:50:36,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:36,757 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:50:36,770 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i[915,928] [2024-10-13 00:50:36,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:50:36,836 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:50:36,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36 WrapperNode [2024-10-13 00:50:36,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:50:36,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:36,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:50:36,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:50:36,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,918 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-10-13 00:50:36,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:50:36,920 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:50:36,920 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:50:36,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:50:36,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,971 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:50:36,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:36,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:37,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:50:37,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:50:37,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:50:37,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:50:37,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (1/1) ... [2024-10-13 00:50:37,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:50:37,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:50:37,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:50:37,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:50:37,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:50:37,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:50:37,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:50:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:50:37,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:50:37,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:50:37,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:50:37,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:50:37,679 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:50:37,680 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:50:37,725 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:50:37,725 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:50:37,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:37 BoogieIcfgContainer [2024-10-13 00:50:37,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:50:37,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:50:37,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:50:37,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:50:37,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:50:36" (1/3) ... [2024-10-13 00:50:37,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc00fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:37, skipping insertion in model container [2024-10-13 00:50:37,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:50:36" (2/3) ... [2024-10-13 00:50:37,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc00fe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:50:37, skipping insertion in model container [2024-10-13 00:50:37,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:50:37" (3/3) ... [2024-10-13 00:50:37,738 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2024-10-13 00:50:37,755 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:50:37,755 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:50:37,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:50:37,825 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;@20b9b2a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:50:37,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:50:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 00:50:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 00:50:37,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:37,849 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:37,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:37,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2018427028, now seen corresponding path program 1 times [2024-10-13 00:50:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132206793] [2024-10-13 00:50:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:50:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:50:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:50:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:50:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:50:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:50:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:50:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:50:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:50:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:50:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:50:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:50:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:50:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:50:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:50:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:50:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:50:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:50:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:50:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:50:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:50:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:50:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:50:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:50:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:50:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:50:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:50:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:50:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:50:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:50:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:50:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:50:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:50:38,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:38,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132206793] [2024-10-13 00:50:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132206793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:38,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:50:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856847810] [2024-10-13 00:50:38,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:38,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:50:38,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:50:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:38,545 INFO L87 Difference]: Start difference. First operand has 84 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 00:50:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:38,602 INFO L93 Difference]: Finished difference Result 165 states and 297 transitions. [2024-10-13 00:50:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:50:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2024-10-13 00:50:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:38,617 INFO L225 Difference]: With dead ends: 165 [2024-10-13 00:50:38,618 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 00:50:38,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:50:38,630 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:38,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:50:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 00:50:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 00:50:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-13 00:50:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 128 transitions. [2024-10-13 00:50:38,698 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 128 transitions. Word has length 200 [2024-10-13 00:50:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:38,700 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 128 transitions. [2024-10-13 00:50:38,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 00:50:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 128 transitions. [2024-10-13 00:50:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 00:50:38,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:38,706 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:50:38,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1061213142, now seen corresponding path program 1 times [2024-10-13 00:50:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:38,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62422829] [2024-10-13 00:50:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:50:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:50:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:50:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:50:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:50:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:50:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:50:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:50:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:50:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:50:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:50:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:50:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:50:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:50:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:50:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:50:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:50:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:50:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:50:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:50:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:50:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:50:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:50:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:50:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:50:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:50:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:50:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:50:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:50:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:50:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:50:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:50:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:50:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62422829] [2024-10-13 00:50:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62422829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 00:50:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448154127] [2024-10-13 00:50:40,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:40,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:50:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:50:40,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:50:40,594 INFO L87 Difference]: Start difference. First operand 82 states and 128 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:41,186 INFO L93 Difference]: Finished difference Result 245 states and 383 transitions. [2024-10-13 00:50:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:50:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-13 00:50:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:41,190 INFO L225 Difference]: With dead ends: 245 [2024-10-13 00:50:41,190 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 00:50:41,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:50:41,193 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 138 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:41,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 444 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:50:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 00:50:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 144. [2024-10-13 00:50:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:50:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2024-10-13 00:50:41,243 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 200 [2024-10-13 00:50:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:41,246 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2024-10-13 00:50:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2024-10-13 00:50:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 00:50:41,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:41,250 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:50:41,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1762277720, now seen corresponding path program 1 times [2024-10-13 00:50:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070055554] [2024-10-13 00:50:41,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:50:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:50:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:50:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:50:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:50:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:50:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:50:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:50:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:50:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:50:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:50:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:50:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:50:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:50:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:50:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:50:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:50:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:50:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:50:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:50:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:50:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:50:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:50:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:50:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:50:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:50:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:50:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:50:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:50:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:50:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:50:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:50:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:50:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:57,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070055554] [2024-10-13 00:50:57,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070055554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:57,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:57,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:50:57,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934130166] [2024-10-13 00:50:57,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:50:57,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:50:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:50:57,825 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:58,872 INFO L93 Difference]: Finished difference Result 308 states and 472 transitions. [2024-10-13 00:50:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:50:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-13 00:50:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:58,877 INFO L225 Difference]: With dead ends: 308 [2024-10-13 00:50:58,877 INFO L226 Difference]: Without dead ends: 227 [2024-10-13 00:50:58,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:50:58,879 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 189 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:58,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 639 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 00:50:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-13 00:50:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 160. [2024-10-13 00:50:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:50:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 250 transitions. [2024-10-13 00:50:58,914 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 250 transitions. Word has length 200 [2024-10-13 00:50:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:58,915 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 250 transitions. [2024-10-13 00:50:58,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 250 transitions. [2024-10-13 00:50:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 00:50:58,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:58,918 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:58,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:50:58,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1082219350, now seen corresponding path program 1 times [2024-10-13 00:50:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:58,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585756179] [2024-10-13 00:50:58,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:50:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:50:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:50:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:50:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:50:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:50:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:50:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:50:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:50:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:50:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:50:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:50:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:50:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:50:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:50:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:50:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:50:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:50:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:50:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:50:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:50:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:50:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:50:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:50:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:50:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:50:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:50:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:50:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:50:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:50:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:50:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:50:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:50:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:50:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:50:59,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:50:59,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585756179] [2024-10-13 00:50:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585756179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:50:59,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:50:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:50:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232203841] [2024-10-13 00:50:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:50:59,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:50:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:50:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:50:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:50:59,260 INFO L87 Difference]: Start difference. First operand 160 states and 250 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:50:59,344 INFO L93 Difference]: Finished difference Result 284 states and 439 transitions. [2024-10-13 00:50:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:50:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-13 00:50:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:50:59,349 INFO L225 Difference]: With dead ends: 284 [2024-10-13 00:50:59,350 INFO L226 Difference]: Without dead ends: 190 [2024-10-13 00:50:59,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:50:59,353 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 40 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:50:59,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:50:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-13 00:50:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-10-13 00:50:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:50:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 287 transitions. [2024-10-13 00:50:59,393 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 287 transitions. Word has length 200 [2024-10-13 00:50:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:50:59,394 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 287 transitions. [2024-10-13 00:50:59,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:50:59,394 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 287 transitions. [2024-10-13 00:50:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 00:50:59,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:50:59,398 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:50:59,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:50:59,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:50:59,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:50:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2139662566, now seen corresponding path program 1 times [2024-10-13 00:50:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:50:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853876079] [2024-10-13 00:50:59,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:50:59,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:50:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:09,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:09,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853876079] [2024-10-13 00:51:09,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853876079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:09,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:51:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222078858] [2024-10-13 00:51:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:09,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:51:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:51:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:51:09,650 INFO L87 Difference]: Start difference. First operand 187 states and 287 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:10,378 INFO L93 Difference]: Finished difference Result 345 states and 520 transitions. [2024-10-13 00:51:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:51:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 200 [2024-10-13 00:51:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:10,382 INFO L225 Difference]: With dead ends: 345 [2024-10-13 00:51:10,382 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 00:51:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:51:10,384 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 166 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 336 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:51:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 00:51:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 187. [2024-10-13 00:51:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:51:10,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 287 transitions. [2024-10-13 00:51:10,415 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 287 transitions. Word has length 200 [2024-10-13 00:51:10,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:10,415 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 287 transitions. [2024-10-13 00:51:10,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 287 transitions. [2024-10-13 00:51:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:10,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:10,418 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:10,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:51:10,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1811160627, now seen corresponding path program 1 times [2024-10-13 00:51:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:10,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117531086] [2024-10-13 00:51:10,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:10,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117531086] [2024-10-13 00:51:17,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117531086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:17,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:17,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 00:51:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506561854] [2024-10-13 00:51:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:17,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 00:51:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 00:51:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:51:17,440 INFO L87 Difference]: Start difference. First operand 187 states and 287 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:19,093 INFO L93 Difference]: Finished difference Result 499 states and 740 transitions. [2024-10-13 00:51:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 00:51:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 00:51:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:19,098 INFO L225 Difference]: With dead ends: 499 [2024-10-13 00:51:19,099 INFO L226 Difference]: Without dead ends: 378 [2024-10-13 00:51:19,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-13 00:51:19,101 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 502 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:19,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 596 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 00:51:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-13 00:51:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 192. [2024-10-13 00:51:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:51:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2024-10-13 00:51:19,137 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 201 [2024-10-13 00:51:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2024-10-13 00:51:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2024-10-13 00:51:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:19,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:19,142 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 00:51:19,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1131102257, now seen corresponding path program 1 times [2024-10-13 00:51:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688699362] [2024-10-13 00:51:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688699362] [2024-10-13 00:51:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688699362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:51:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781953959] [2024-10-13 00:51:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:51:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:51:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:51:24,384 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:25,121 INFO L93 Difference]: Finished difference Result 442 states and 662 transitions. [2024-10-13 00:51:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:51:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 00:51:25,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:25,124 INFO L225 Difference]: With dead ends: 442 [2024-10-13 00:51:25,124 INFO L226 Difference]: Without dead ends: 321 [2024-10-13 00:51:25,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:51:25,126 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 118 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:25,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 708 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 00:51:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-13 00:51:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 207. [2024-10-13 00:51:25,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 133 states have (on average 1.330827067669173) internal successors, (177), 134 states have internal predecessors, (177), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:51:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 317 transitions. [2024-10-13 00:51:25,154 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 317 transitions. Word has length 201 [2024-10-13 00:51:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:25,154 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 317 transitions. [2024-10-13 00:51:25,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 317 transitions. [2024-10-13 00:51:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:25,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:25,157 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:25,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 00:51:25,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2090779659, now seen corresponding path program 1 times [2024-10-13 00:51:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:25,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972734361] [2024-10-13 00:51:25,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:25,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972734361] [2024-10-13 00:51:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972734361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 00:51:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970639335] [2024-10-13 00:51:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 00:51:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:32,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 00:51:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:51:32,522 INFO L87 Difference]: Start difference. First operand 207 states and 317 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:33,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:33,114 INFO L93 Difference]: Finished difference Result 424 states and 638 transitions. [2024-10-13 00:51:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 00:51:33,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 00:51:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:33,117 INFO L225 Difference]: With dead ends: 424 [2024-10-13 00:51:33,117 INFO L226 Difference]: Without dead ends: 290 [2024-10-13 00:51:33,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:51:33,119 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 163 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:33,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 474 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 00:51:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-13 00:51:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 204. [2024-10-13 00:51:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 131 states have internal predecessors, (173), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:51:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2024-10-13 00:51:33,151 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 201 [2024-10-13 00:51:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:33,151 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2024-10-13 00:51:33,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2024-10-13 00:51:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:33,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:33,154 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:33,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 00:51:33,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:33,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1524129267, now seen corresponding path program 1 times [2024-10-13 00:51:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61921113] [2024-10-13 00:51:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:33,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:38,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61921113] [2024-10-13 00:51:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61921113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:38,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:38,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 00:51:38,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129146603] [2024-10-13 00:51:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:38,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:51:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:51:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:51:38,974 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:39,563 INFO L93 Difference]: Finished difference Result 418 states and 629 transitions. [2024-10-13 00:51:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 00:51:39,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 00:51:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:39,566 INFO L225 Difference]: With dead ends: 418 [2024-10-13 00:51:39,566 INFO L226 Difference]: Without dead ends: 283 [2024-10-13 00:51:39,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 00:51:39,567 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 115 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:39,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 561 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 00:51:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-13 00:51:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2024-10-13 00:51:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 130 states have internal predecessors, (171), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:51:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 311 transitions. [2024-10-13 00:51:39,589 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 311 transitions. Word has length 201 [2024-10-13 00:51:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:39,590 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 311 transitions. [2024-10-13 00:51:39,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 311 transitions. [2024-10-13 00:51:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:39,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:39,593 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 00:51:39,593 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1472689419, now seen corresponding path program 1 times [2024-10-13 00:51:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808271060] [2024-10-13 00:51:39,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:39,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:39,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808271060] [2024-10-13 00:51:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808271060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:39,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:39,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:51:39,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361453092] [2024-10-13 00:51:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:39,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:51:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:51:39,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:51:39,813 INFO L87 Difference]: Start difference. First operand 203 states and 311 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:39,893 INFO L93 Difference]: Finished difference Result 364 states and 547 transitions. [2024-10-13 00:51:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:51:39,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-13 00:51:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:39,896 INFO L225 Difference]: With dead ends: 364 [2024-10-13 00:51:39,896 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 00:51:39,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:51:39,898 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:39,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 378 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:51:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 00:51:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 192. [2024-10-13 00:51:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 121 states have internal predecessors, (159), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:51:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2024-10-13 00:51:39,916 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 201 [2024-10-13 00:51:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:39,916 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2024-10-13 00:51:39,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-13 00:51:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2024-10-13 00:51:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:39,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:39,918 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:39,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 00:51:39,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:39,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2142219507, now seen corresponding path program 1 times [2024-10-13 00:51:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:39,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389212607] [2024-10-13 00:51:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:39,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:51:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:51:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:51:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:51:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:51:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:51:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:51:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:51:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:51:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:51:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:51:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:51:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:51:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:51:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:51:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:51:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:51:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:51:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:51:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:51:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:51:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:51:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:51:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:51:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:51:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:51:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:51:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:51:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:51:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:51:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:51:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:51:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:51:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:51:45,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-13 00:51:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:51:45,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389212607] [2024-10-13 00:51:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389212607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:51:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:51:45,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 00:51:45,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959051634] [2024-10-13 00:51:45,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:51:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 00:51:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:51:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 00:51:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-13 00:51:45,182 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 00:51:46,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:51:46,832 INFO L93 Difference]: Finished difference Result 400 states and 592 transitions. [2024-10-13 00:51:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:51:46,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-13 00:51:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:51:46,835 INFO L225 Difference]: With dead ends: 400 [2024-10-13 00:51:46,835 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 00:51:46,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-10-13 00:51:46,836 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 299 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 00:51:46,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 735 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 00:51:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 00:51:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 196. [2024-10-13 00:51:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 125 states have (on average 1.312) internal successors, (164), 125 states have internal predecessors, (164), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 00:51:46,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 296 transitions. [2024-10-13 00:51:46,857 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 296 transitions. Word has length 201 [2024-10-13 00:51:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:51:46,858 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 296 transitions. [2024-10-13 00:51:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 00:51:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 296 transitions. [2024-10-13 00:51:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 00:51:46,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:51:46,859 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:51:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 00:51:46,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:51:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:51:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1759720779, now seen corresponding path program 1 times [2024-10-13 00:51:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:51:46,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255323561] [2024-10-13 00:51:46,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:51:46,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:51:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat