./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.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 6afecf8b719ebabe0f5d950a91928c70dceb2d3c076eae572c5fd9dee7e38018 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:25:12,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:25:12,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:25:12,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:25:12,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:25:12,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:25:12,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:25:12,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:25:12,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:25:12,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:25:12,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:25:12,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:25:12,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:25:12,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:25:12,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:25:12,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:25:12,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:25:12,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:25:12,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:25:12,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:25:12,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:25:12,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:25:12,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:25:12,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:25:12,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:25:12,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:25:12,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:25:12,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:25:12,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:25:12,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:25:12,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:25:12,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:25:12,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:25:12,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:25:12,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:25:12,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:25:12,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:25:12,804 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 -> 6afecf8b719ebabe0f5d950a91928c70dceb2d3c076eae572c5fd9dee7e38018 [2024-11-09 01:25:13,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:25:13,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:25:13,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:25:13,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:25:13,048 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:25:13,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.i [2024-11-09 01:25:14,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:25:14,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:25:14,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.i [2024-11-09 01:25:14,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6674520a/c379185cf8614b56a6bf31c039ce1deb/FLAG6f113b2d2 [2024-11-09 01:25:15,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6674520a/c379185cf8614b56a6bf31c039ce1deb [2024-11-09 01:25:15,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:25:15,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:25:15,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:25:15,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:25:15,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:25:15,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6a381e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15, skipping insertion in model container [2024-11-09 01:25:15,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:25:15,197 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.i[913,926] [2024-11-09 01:25:15,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:25:15,283 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:25:15,305 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-85.i[913,926] [2024-11-09 01:25:15,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:25:15,350 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:25:15,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15 WrapperNode [2024-11-09 01:25:15,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:25:15,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:25:15,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:25:15,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:25:15,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,400 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-09 01:25:15,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:25:15,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:25:15,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:25:15,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:25:15,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,436 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 01:25:15,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:25:15,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:25:15,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:25:15,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:25:15,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (1/1) ... [2024-11-09 01:25:15,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:25:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:25:15,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:25:15,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:25:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:25:15,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:25:15,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:25:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:25:15,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:25:15,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:25:15,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:25:15,602 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:25:15,823 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 01:25:15,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:25:15,837 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:25:15,837 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:25:15,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:25:15 BoogieIcfgContainer [2024-11-09 01:25:15,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:25:15,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:25:15,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:25:15,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:25:15,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:25:15" (1/3) ... [2024-11-09 01:25:15,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae2f2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:25:15, skipping insertion in model container [2024-11-09 01:25:15,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:25:15" (2/3) ... [2024-11-09 01:25:15,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae2f2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:25:15, skipping insertion in model container [2024-11-09 01:25:15,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:25:15" (3/3) ... [2024-11-09 01:25:15,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-85.i [2024-11-09 01:25:15,860 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:25:15,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:25:15,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:25:15,924 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;@4516751e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:25:15,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:25:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:25:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:25:15,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:15,945 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:15,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:15,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2080080809, now seen corresponding path program 1 times [2024-11-09 01:25:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:15,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063896195] [2024-11-09 01:25:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:15,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:16,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063896195] [2024-11-09 01:25:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063896195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:25:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908062207] [2024-11-09 01:25:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:16,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:25:16,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:25:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:25:16,361 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:25:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:16,404 INFO L93 Difference]: Finished difference Result 111 states and 195 transitions. [2024-11-09 01:25:16,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:25:16,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2024-11-09 01:25:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:16,412 INFO L225 Difference]: With dead ends: 111 [2024-11-09 01:25:16,412 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 01:25:16,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:25:16,417 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:16,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:25:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 01:25:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 01:25:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 01:25:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2024-11-09 01:25:16,501 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 139 [2024-11-09 01:25:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:16,501 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2024-11-09 01:25:16,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 01:25:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2024-11-09 01:25:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:25:16,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:16,506 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:25:16,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash 765421479, now seen corresponding path program 1 times [2024-11-09 01:25:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:16,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900060616] [2024-11-09 01:25:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:22,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:22,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:22,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900060616] [2024-11-09 01:25:22,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900060616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:22,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:22,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:25:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009137449] [2024-11-09 01:25:22,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:22,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:25:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:25:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:25:22,010 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:23,755 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-11-09 01:25:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:25:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-11-09 01:25:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:23,760 INFO L225 Difference]: With dead ends: 103 [2024-11-09 01:25:23,760 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 01:25:23,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:25:23,761 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 81 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:23,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 385 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:25:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 01:25:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2024-11-09 01:25:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 01:25:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-09 01:25:23,774 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 139 [2024-11-09 01:25:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-09 01:25:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-09 01:25:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 01:25:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:23,777 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:25:23,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:23,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -43925147, now seen corresponding path program 1 times [2024-11-09 01:25:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218137182] [2024-11-09 01:25:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218137182] [2024-11-09 01:25:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218137182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:27,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 01:25:27,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829847873] [2024-11-09 01:25:27,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 01:25:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:27,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 01:25:27,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 01:25:27,983 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:30,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:30,399 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2024-11-09 01:25:30,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:25:30,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-11-09 01:25:30,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:30,401 INFO L225 Difference]: With dead ends: 108 [2024-11-09 01:25:30,401 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:25:30,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:25:30,402 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:30,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 447 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:25:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:25:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 67. [2024-11-09 01:25:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 01:25:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-11-09 01:25:30,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 139 [2024-11-09 01:25:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:30,413 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-11-09 01:25:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-11-09 01:25:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:25:30,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:30,415 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:30,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:25:30,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:30,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236148, now seen corresponding path program 1 times [2024-11-09 01:25:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:30,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859361457] [2024-11-09 01:25:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:35,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:35,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859361457] [2024-11-09 01:25:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859361457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:35,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:35,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:25:35,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509216179] [2024-11-09 01:25:35,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:35,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:25:35,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:35,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:25:35,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:25:35,705 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:37,857 INFO L93 Difference]: Finished difference Result 117 states and 153 transitions. [2024-11-09 01:25:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:25:37,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:25:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:37,860 INFO L225 Difference]: With dead ends: 117 [2024-11-09 01:25:37,860 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 01:25:37,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-09 01:25:37,867 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 78 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:37,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 503 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:25:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 01:25:37,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2024-11-09 01:25:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 01:25:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-09 01:25:37,896 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 140 [2024-11-09 01:25:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:37,896 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-09 01:25:37,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-09 01:25:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:25:37,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:37,898 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:37,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:25:37,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:37,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:37,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1986389106, now seen corresponding path program 1 times [2024-11-09 01:25:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:37,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282322464] [2024-11-09 01:25:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:40,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:40,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282322464] [2024-11-09 01:25:40,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282322464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:40,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:40,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:25:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525100023] [2024-11-09 01:25:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:40,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:25:40,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:40,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:25:40,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:25:40,143 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:40,485 INFO L93 Difference]: Finished difference Result 126 states and 164 transitions. [2024-11-09 01:25:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:25:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:25:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:40,487 INFO L225 Difference]: With dead ends: 126 [2024-11-09 01:25:40,487 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:25:40,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:25:40,488 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 74 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:40,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 430 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:25:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:25:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2024-11-09 01:25:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 01:25:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-09 01:25:40,500 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 140 [2024-11-09 01:25:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:40,501 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-09 01:25:40,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-09 01:25:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:25:40,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:40,503 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:40,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:25:40,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:40,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash -760610968, now seen corresponding path program 1 times [2024-11-09 01:25:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:40,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805628612] [2024-11-09 01:25:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:46,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:46,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805628612] [2024-11-09 01:25:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805628612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:25:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890093260] [2024-11-09 01:25:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:46,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:25:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:25:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:25:46,104 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:47,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:47,109 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2024-11-09 01:25:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:25:47,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:25:47,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:47,116 INFO L225 Difference]: With dead ends: 185 [2024-11-09 01:25:47,116 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 01:25:47,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-09 01:25:47,118 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 93 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:47,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 313 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:25:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 01:25:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-11-09 01:25:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-09 01:25:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2024-11-09 01:25:47,137 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 140 [2024-11-09 01:25:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:47,139 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2024-11-09 01:25:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2024-11-09 01:25:47,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:25:47,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:47,140 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:47,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:25:47,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:47,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -817869270, now seen corresponding path program 1 times [2024-11-09 01:25:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:47,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710894126] [2024-11-09 01:25:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:25:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:25:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:25:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:25:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:25:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:25:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:25:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:25:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:25:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:25:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:25:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:25:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:25:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:25:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:25:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:25:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:25:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:25:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:25:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:25:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:25:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:25:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:25:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:25:54,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:25:54,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710894126] [2024-11-09 01:25:54,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710894126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:54,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:25:54,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:25:54,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898326545] [2024-11-09 01:25:54,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:54,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:25:54,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:25:54,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:25:54,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:25:54,752 INFO L87 Difference]: Start difference. First operand 103 states and 142 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:25:57,447 INFO L93 Difference]: Finished difference Result 173 states and 221 transitions. [2024-11-09 01:25:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:25:57,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:25:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:25:57,449 INFO L225 Difference]: With dead ends: 173 [2024-11-09 01:25:57,449 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 01:25:57,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:25:57,450 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 122 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:25:57,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 422 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:25:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 01:25:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 96. [2024-11-09 01:25:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 60 states have internal predecessors, (72), 31 states have call successors, (31), 5 states have call predecessors, (31), 5 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:25:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2024-11-09 01:25:57,466 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 140 [2024-11-09 01:25:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:25:57,467 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2024-11-09 01:25:57,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:25:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2024-11-09 01:25:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:25:57,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:25:57,468 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:25:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 01:25:57,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:25:57,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:25:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1308177778, now seen corresponding path program 1 times [2024-11-09 01:25:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:25:57,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410803415] [2024-11-09 01:25:57,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:25:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:25:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:03,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:03,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410803415] [2024-11-09 01:26:03,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410803415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:03,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:03,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:26:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778172233] [2024-11-09 01:26:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:03,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:26:03,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:26:03,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:26:03,089 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:04,619 INFO L93 Difference]: Finished difference Result 142 states and 181 transitions. [2024-11-09 01:26:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 01:26:04,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:26:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:04,621 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:26:04,621 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 01:26:04,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:26:04,623 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 88 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:04,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 317 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 01:26:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 01:26:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2024-11-09 01:26:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 64 states have internal predecessors, (77), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:26:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2024-11-09 01:26:04,639 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 140 [2024-11-09 01:26:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:04,640 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2024-11-09 01:26:04,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2024-11-09 01:26:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:26:04,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:04,641 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:04,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:26:04,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:04,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1306330736, now seen corresponding path program 1 times [2024-11-09 01:26:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:04,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005770269] [2024-11-09 01:26:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:07,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005770269] [2024-11-09 01:26:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005770269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:07,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 01:26:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973441634] [2024-11-09 01:26:07,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 01:26:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:07,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 01:26:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:26:07,260 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:07,635 INFO L93 Difference]: Finished difference Result 152 states and 193 transitions. [2024-11-09 01:26:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:26:07,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:26:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:07,637 INFO L225 Difference]: With dead ends: 152 [2024-11-09 01:26:07,637 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 01:26:07,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:26:07,638 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 75 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:07,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 433 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:26:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 01:26:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 98. [2024-11-09 01:26:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:26:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-11-09 01:26:07,653 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 140 [2024-11-09 01:26:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:07,654 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-11-09 01:26:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-11-09 01:26:07,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:26:07,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:07,655 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 01:26:07,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:07,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash -80552598, now seen corresponding path program 1 times [2024-11-09 01:26:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417577288] [2024-11-09 01:26:07,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:07,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417577288] [2024-11-09 01:26:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417577288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:26:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917260160] [2024-11-09 01:26:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:11,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:26:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:26:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:26:11,530 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:13,134 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2024-11-09 01:26:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:26:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:26:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:13,136 INFO L225 Difference]: With dead ends: 213 [2024-11-09 01:26:13,136 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 01:26:13,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:26:13,139 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 79 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:13,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 469 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:26:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 01:26:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 98. [2024-11-09 01:26:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:26:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 133 transitions. [2024-11-09 01:26:13,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 133 transitions. Word has length 140 [2024-11-09 01:26:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:13,166 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 133 transitions. [2024-11-09 01:26:13,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 133 transitions. [2024-11-09 01:26:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 01:26:13,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:13,168 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:13,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 01:26:13,168 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash -137810900, now seen corresponding path program 1 times [2024-11-09 01:26:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:13,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600275657] [2024-11-09 01:26:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:18,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600275657] [2024-11-09 01:26:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600275657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 01:26:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196395702] [2024-11-09 01:26:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:26:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:26:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:26:18,702 INFO L87 Difference]: Start difference. First operand 98 states and 133 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:21,004 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2024-11-09 01:26:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:26:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-11-09 01:26:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:21,006 INFO L225 Difference]: With dead ends: 140 [2024-11-09 01:26:21,006 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 01:26:21,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-09 01:26:21,007 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 69 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:21,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 487 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:26:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 01:26:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 94. [2024-11-09 01:26:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 57 states have internal predecessors, (64), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:26:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2024-11-09 01:26:21,043 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 140 [2024-11-09 01:26:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:21,043 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2024-11-09 01:26:21,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2024-11-09 01:26:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:26:21,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:21,050 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:21,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 01:26:21,051 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:21,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash 469358185, now seen corresponding path program 1 times [2024-11-09 01:26:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740454919] [2024-11-09 01:26:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740454919] [2024-11-09 01:26:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740454919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:26:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664063558] [2024-11-09 01:26:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:28,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:26:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:26:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:26:28,642 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:33,103 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2024-11-09 01:26:33,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:26:33,104 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-09 01:26:33,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:33,105 INFO L225 Difference]: With dead ends: 141 [2024-11-09 01:26:33,105 INFO L226 Difference]: Without dead ends: 139 [2024-11-09 01:26:33,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:26:33,106 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 77 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:33,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 449 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 01:26:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-09 01:26:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2024-11-09 01:26:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 60 states have internal predecessors, (69), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-09 01:26:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-09 01:26:33,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 141 [2024-11-09 01:26:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:33,122 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-09 01:26:33,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-09 01:26:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 01:26:33,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:33,123 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:33,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 01:26:33,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:26:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash 76331175, now seen corresponding path program 1 times [2024-11-09 01:26:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:26:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141301106] [2024-11-09 01:26:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:33,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:26:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:26:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:26:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:26:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:26:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:26:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:26:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:26:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:26:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 01:26:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 01:26:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 01:26:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 01:26:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 01:26:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 01:26:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 01:26:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 01:26:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 01:26:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 01:26:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 01:26:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 01:26:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 01:26:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 01:26:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 01:26:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:26:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141301106] [2024-11-09 01:26:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141301106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:26:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:26:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 01:26:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384148870] [2024-11-09 01:26:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:26:39,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:26:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:26:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:26:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 01:26:39,863 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:42,776 INFO L93 Difference]: Finished difference Result 134 states and 171 transitions. [2024-11-09 01:26:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:26:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2024-11-09 01:26:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:42,777 INFO L225 Difference]: With dead ends: 134 [2024-11-09 01:26:42,777 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 01:26:42,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-09 01:26:42,778 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 75 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:42,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 485 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 01:26:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 01:26:42,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 01:26:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 01:26:42,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2024-11-09 01:26:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:42,779 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 01:26:42,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 01:26:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 01:26:42,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 01:26:42,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:26:42,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:26:42,785 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:26:42,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.