./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.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 bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:05:37,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:05:37,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:05:37,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:05:37,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:05:37,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:05:37,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:05:37,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:05:37,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:05:37,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:05:37,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:05:37,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:05:37,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:05:37,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:05:37,527 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:05:37,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:05:37,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:05:37,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:05:37,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:05:37,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:05:37,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:05:37,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:05:37,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:05:37,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:05:37,529 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:05:37,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:05:37,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:05:37,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:05:37,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:05:37,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:05:37,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:05:37,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:05:37,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:37,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:05:37,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:05:37,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:05:37,532 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:05:37,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:05:37,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:05:37,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:05:37,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:05:37,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:05:37,536 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 -> bad025599360e4a40c7e5eb7ae8774b458dde60117017db7c90fc21953b8de16 [2024-11-19 00:05:37,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:05:37,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:05:37,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:05:37,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:05:37,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:05:37,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i [2024-11-19 00:05:39,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:05:39,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:05:39,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i [2024-11-19 00:05:39,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ccbcb3ef/31e21e0d5fdc4ba5bd13eb26d0494893/FLAGaebc19e91 [2024-11-19 00:05:39,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ccbcb3ef/31e21e0d5fdc4ba5bd13eb26d0494893 [2024-11-19 00:05:39,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:05:39,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:05:39,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:39,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:05:39,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:05:39,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3f3157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39, skipping insertion in model container [2024-11-19 00:05:39,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:05:39,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i[916,929] [2024-11-19 00:05:39,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:39,746 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:05:39,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-61.i[916,929] [2024-11-19 00:05:39,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:05:39,843 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:05:39,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39 WrapperNode [2024-11-19 00:05:39,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:05:39,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:39,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:05:39,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:05:39,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,926 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 724 [2024-11-19 00:05:39,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:05:39,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:05:39,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:05:39,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:05:39,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,983 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-19 00:05:39,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:39,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:05:40,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:05:40,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:05:40,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:05:40,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (1/1) ... [2024-11-19 00:05:40,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:05:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:40,065 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-19 00:05:40,067 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-19 00:05:40,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:05:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:05:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:05:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:05:40,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:05:40,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:05:40,230 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:05:40,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:05:41,167 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-19 00:05:41,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:05:41,184 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:05:41,185 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:05:41,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:41 BoogieIcfgContainer [2024-11-19 00:05:41,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:05:41,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:05:41,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:05:41,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:05:41,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:05:39" (1/3) ... [2024-11-19 00:05:41,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf0b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:41, skipping insertion in model container [2024-11-19 00:05:41,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:05:39" (2/3) ... [2024-11-19 00:05:41,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34cf0b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:05:41, skipping insertion in model container [2024-11-19 00:05:41,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:05:41" (3/3) ... [2024-11-19 00:05:41,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-61.i [2024-11-19 00:05:41,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:05:41,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:05:41,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:05:41,280 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;@26da5456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:05:41,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:05:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 220 states have (on average 1.559090909090909) internal successors, (343), 221 states have internal predecessors, (343), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:05:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:41,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:41,314 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:41,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:41,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash -299403556, now seen corresponding path program 1 times [2024-11-19 00:05:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:41,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749090211] [2024-11-19 00:05:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2024-11-19 00:05:41,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749090211] [2024-11-19 00:05:41,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749090211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:05:41,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863043175] [2024-11-19 00:05:41,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:41,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:05:41,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:05:41,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:05:41,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:05:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:42,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:05:42,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:05:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 8450 trivial. 0 not checked. [2024-11-19 00:05:42,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:05:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863043175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:42,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:05:42,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:05:42,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705502716] [2024-11-19 00:05:42,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:05:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:05:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:05:42,334 INFO L87 Difference]: Start difference. First operand has 289 states, 220 states have (on average 1.559090909090909) internal successors, (343), 221 states have internal predecessors, (343), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:05:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:42,395 INFO L93 Difference]: Finished difference Result 571 states and 1010 transitions. [2024-11-19 00:05:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:05:42,397 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) Word has length 459 [2024-11-19 00:05:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:42,406 INFO L225 Difference]: With dead ends: 571 [2024-11-19 00:05:42,406 INFO L226 Difference]: Without dead ends: 285 [2024-11-19 00:05:42,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 460 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-19 00:05:42,415 INFO L432 NwaCegarLoop]: 468 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, 468 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-19 00:05:42,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-19 00:05:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-19 00:05:42,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 217 states have (on average 1.5483870967741935) internal successors, (336), 217 states have internal predecessors, (336), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:05:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 468 transitions. [2024-11-19 00:05:42,489 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 468 transitions. Word has length 459 [2024-11-19 00:05:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:42,490 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 468 transitions. [2024-11-19 00:05:42,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 2 states have call successors, (66), 2 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:05:42,490 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 468 transitions. [2024-11-19 00:05:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:42,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:42,500 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:42,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:05:42,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:05:42,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:42,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:42,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2135779680, now seen corresponding path program 1 times [2024-11-19 00:05:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127431165] [2024-11-19 00:05:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127431165] [2024-11-19 00:05:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127431165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047545957] [2024-11-19 00:05:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:43,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:43,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:43,093 INFO L87 Difference]: Start difference. First operand 285 states and 468 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:43,206 INFO L93 Difference]: Finished difference Result 837 states and 1378 transitions. [2024-11-19 00:05:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:43,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2024-11-19 00:05:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:43,214 INFO L225 Difference]: With dead ends: 837 [2024-11-19 00:05:43,214 INFO L226 Difference]: Without dead ends: 555 [2024-11-19 00:05:43,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:43,220 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 459 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:43,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 894 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-19 00:05:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 394. [2024-11-19 00:05:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 326 states have (on average 1.607361963190184) internal successors, (524), 326 states have internal predecessors, (524), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:05:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 656 transitions. [2024-11-19 00:05:43,269 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 656 transitions. Word has length 459 [2024-11-19 00:05:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:43,272 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 656 transitions. [2024-11-19 00:05:43,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 656 transitions. [2024-11-19 00:05:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:43,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:43,281 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:43,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:05:43,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:43,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1718383074, now seen corresponding path program 1 times [2024-11-19 00:05:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380805386] [2024-11-19 00:05:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:43,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:43,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380805386] [2024-11-19 00:05:43,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380805386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:43,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:43,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100929262] [2024-11-19 00:05:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:43,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:43,627 INFO L87 Difference]: Start difference. First operand 394 states and 656 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:43,731 INFO L93 Difference]: Finished difference Result 1176 states and 1962 transitions. [2024-11-19 00:05:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2024-11-19 00:05:43,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:43,739 INFO L225 Difference]: With dead ends: 1176 [2024-11-19 00:05:43,740 INFO L226 Difference]: Without dead ends: 785 [2024-11-19 00:05:43,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:43,743 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 455 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:43,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1169 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:05:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-19 00:05:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 534. [2024-11-19 00:05:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 466 states have (on average 1.6351931330472103) internal successors, (762), 466 states have internal predecessors, (762), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-19 00:05:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 894 transitions. [2024-11-19 00:05:43,775 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 894 transitions. Word has length 459 [2024-11-19 00:05:43,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:43,777 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 894 transitions. [2024-11-19 00:05:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 894 transitions. [2024-11-19 00:05:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:43,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:43,785 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:43,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:05:43,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:43,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1613024998, now seen corresponding path program 1 times [2024-11-19 00:05:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977889816] [2024-11-19 00:05:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977889816] [2024-11-19 00:05:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977889816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:44,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338749239] [2024-11-19 00:05:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:44,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:44,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:44,085 INFO L87 Difference]: Start difference. First operand 534 states and 894 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:44,155 INFO L93 Difference]: Finished difference Result 1496 states and 2505 transitions. [2024-11-19 00:05:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:44,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2024-11-19 00:05:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:44,160 INFO L225 Difference]: With dead ends: 1496 [2024-11-19 00:05:44,161 INFO L226 Difference]: Without dead ends: 965 [2024-11-19 00:05:44,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:44,163 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 324 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:44,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1044 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-11-19 00:05:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 962. [2024-11-19 00:05:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 848 states have (on average 1.634433962264151) internal successors, (1386), 849 states have internal predecessors, (1386), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-19 00:05:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1608 transitions. [2024-11-19 00:05:44,191 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1608 transitions. Word has length 459 [2024-11-19 00:05:44,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:44,192 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1608 transitions. [2024-11-19 00:05:44,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1608 transitions. [2024-11-19 00:05:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:44,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:44,197 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:44,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:05:44,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:44,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:44,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2036671720, now seen corresponding path program 1 times [2024-11-19 00:05:44,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:44,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261085309] [2024-11-19 00:05:44,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:44,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:44,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:44,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261085309] [2024-11-19 00:05:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261085309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:44,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:44,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277179058] [2024-11-19 00:05:44,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:44,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:44,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:44,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:44,685 INFO L87 Difference]: Start difference. First operand 962 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:44,949 INFO L93 Difference]: Finished difference Result 2733 states and 4577 transitions. [2024-11-19 00:05:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:44,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2024-11-19 00:05:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:44,960 INFO L225 Difference]: With dead ends: 2733 [2024-11-19 00:05:44,960 INFO L226 Difference]: Without dead ends: 1774 [2024-11-19 00:05:44,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:44,963 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 292 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:44,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 833 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2024-11-19 00:05:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1770. [2024-11-19 00:05:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1618 states have (on average 1.6508034610630409) internal successors, (2671), 1621 states have internal predecessors, (2671), 147 states have call successors, (147), 4 states have call predecessors, (147), 4 states have return successors, (147), 144 states have call predecessors, (147), 147 states have call successors, (147) [2024-11-19 00:05:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2965 transitions. [2024-11-19 00:05:45,019 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2965 transitions. Word has length 459 [2024-11-19 00:05:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:45,021 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2965 transitions. [2024-11-19 00:05:45,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2965 transitions. [2024-11-19 00:05:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-19 00:05:45,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:45,028 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:45,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:05:45,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:45,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:45,029 INFO L85 PathProgramCache]: Analyzing trace with hash 350491882, now seen corresponding path program 1 times [2024-11-19 00:05:45,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:45,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800113621] [2024-11-19 00:05:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:45,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:45,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800113621] [2024-11-19 00:05:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800113621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582322062] [2024-11-19 00:05:45,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:45,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:45,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:45,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:45,420 INFO L87 Difference]: Start difference. First operand 1770 states and 2965 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:45,489 INFO L93 Difference]: Finished difference Result 5304 states and 8889 transitions. [2024-11-19 00:05:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:45,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 459 [2024-11-19 00:05:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:45,504 INFO L225 Difference]: With dead ends: 5304 [2024-11-19 00:05:45,504 INFO L226 Difference]: Without dead ends: 3537 [2024-11-19 00:05:45,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:45,509 INFO L432 NwaCegarLoop]: 634 mSDtfsCounter, 314 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:45,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1089 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2024-11-19 00:05:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3535. [2024-11-19 00:05:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 3232 states have (on average 1.6466584158415842) internal successors, (5322), 3238 states have internal predecessors, (5322), 294 states have call successors, (294), 8 states have call predecessors, (294), 8 states have return successors, (294), 288 states have call predecessors, (294), 294 states have call successors, (294) [2024-11-19 00:05:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 5910 transitions. [2024-11-19 00:05:45,643 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 5910 transitions. Word has length 459 [2024-11-19 00:05:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:45,644 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 5910 transitions. [2024-11-19 00:05:45,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 5910 transitions. [2024-11-19 00:05:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:45,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:45,650 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:45,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:05:45,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:45,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:45,651 INFO L85 PathProgramCache]: Analyzing trace with hash 164267190, now seen corresponding path program 1 times [2024-11-19 00:05:45,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:45,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366161232] [2024-11-19 00:05:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:46,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366161232] [2024-11-19 00:05:46,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366161232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 00:05:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599468470] [2024-11-19 00:05:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:46,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 00:05:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 00:05:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:46,365 INFO L87 Difference]: Start difference. First operand 3535 states and 5910 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:46,518 INFO L93 Difference]: Finished difference Result 10599 states and 17724 transitions. [2024-11-19 00:05:46,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 00:05:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2024-11-19 00:05:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:46,546 INFO L225 Difference]: With dead ends: 10599 [2024-11-19 00:05:46,546 INFO L226 Difference]: Without dead ends: 7067 [2024-11-19 00:05:46,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 00:05:46,558 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 345 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:46,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 913 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7067 states. [2024-11-19 00:05:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7067 to 7065. [2024-11-19 00:05:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 6460 states have (on average 1.6439628482972137) internal successors, (10620), 6472 states have internal predecessors, (10620), 588 states have call successors, (588), 16 states have call predecessors, (588), 16 states have return successors, (588), 576 states have call predecessors, (588), 588 states have call successors, (588) [2024-11-19 00:05:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 11796 transitions. [2024-11-19 00:05:46,784 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 11796 transitions. Word has length 460 [2024-11-19 00:05:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:46,785 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 11796 transitions. [2024-11-19 00:05:46,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 11796 transitions. [2024-11-19 00:05:46,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:46,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:46,794 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:46,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:05:46,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:46,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 191332792, now seen corresponding path program 1 times [2024-11-19 00:05:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:46,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312288671] [2024-11-19 00:05:46,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:46,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:47,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312288671] [2024-11-19 00:05:47,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312288671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:47,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:47,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:05:47,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49836467] [2024-11-19 00:05:47,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:47,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:05:47,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:05:47,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:05:47,517 INFO L87 Difference]: Start difference. First operand 7065 states and 11796 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:47,663 INFO L93 Difference]: Finished difference Result 14393 states and 24070 transitions. [2024-11-19 00:05:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:05:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2024-11-19 00:05:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:47,697 INFO L225 Difference]: With dead ends: 14393 [2024-11-19 00:05:47,697 INFO L226 Difference]: Without dead ends: 7331 [2024-11-19 00:05:47,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 00:05:47,712 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 325 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:47,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1404 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:05:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7331 states. [2024-11-19 00:05:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7331 to 7065. [2024-11-19 00:05:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 6460 states have (on average 1.6414860681114551) internal successors, (10604), 6472 states have internal predecessors, (10604), 588 states have call successors, (588), 16 states have call predecessors, (588), 16 states have return successors, (588), 576 states have call predecessors, (588), 588 states have call successors, (588) [2024-11-19 00:05:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 11780 transitions. [2024-11-19 00:05:47,912 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 11780 transitions. Word has length 460 [2024-11-19 00:05:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:47,912 INFO L471 AbstractCegarLoop]: Abstraction has 7065 states and 11780 transitions. [2024-11-19 00:05:47,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 11780 transitions. [2024-11-19 00:05:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:47,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:47,921 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:47,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 00:05:47,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:47,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:47,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1802811914, now seen corresponding path program 1 times [2024-11-19 00:05:47,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:47,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380323644] [2024-11-19 00:05:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380323644] [2024-11-19 00:05:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380323644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 00:05:49,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541604181] [2024-11-19 00:05:49,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:49,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 00:05:49,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:49,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 00:05:49,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 00:05:49,140 INFO L87 Difference]: Start difference. First operand 7065 states and 11780 transitions. Second operand has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:05:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:50,979 INFO L93 Difference]: Finished difference Result 24961 states and 41210 transitions. [2024-11-19 00:05:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 00:05:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460 [2024-11-19 00:05:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:51,024 INFO L225 Difference]: With dead ends: 24961 [2024-11-19 00:05:51,024 INFO L226 Difference]: Without dead ends: 17899 [2024-11-19 00:05:51,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:05:51,041 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 2288 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 1822 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:51,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 1822 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 00:05:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17899 states. [2024-11-19 00:05:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17899 to 12585. [2024-11-19 00:05:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12585 states, 11452 states have (on average 1.6252183024799163) internal successors, (18612), 11488 states have internal predecessors, (18612), 1084 states have call successors, (1084), 48 states have call predecessors, (1084), 48 states have return successors, (1084), 1048 states have call predecessors, (1084), 1084 states have call successors, (1084) [2024-11-19 00:05:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12585 states to 12585 states and 20780 transitions. [2024-11-19 00:05:51,453 INFO L78 Accepts]: Start accepts. Automaton has 12585 states and 20780 transitions. Word has length 460 [2024-11-19 00:05:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:51,454 INFO L471 AbstractCegarLoop]: Abstraction has 12585 states and 20780 transitions. [2024-11-19 00:05:51,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.0) internal successors, (133), 7 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:05:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 12585 states and 20780 transitions. [2024-11-19 00:05:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:51,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:51,472 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:51,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 00:05:51,473 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:51,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1380110088, now seen corresponding path program 1 times [2024-11-19 00:05:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934792013] [2024-11-19 00:05:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:52,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:52,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934792013] [2024-11-19 00:05:52,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934792013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:52,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:52,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 00:05:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430029733] [2024-11-19 00:05:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:52,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 00:05:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 00:05:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:52,885 INFO L87 Difference]: Start difference. First operand 12585 states and 20780 transitions. Second operand has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:53,597 INFO L93 Difference]: Finished difference Result 42941 states and 69912 transitions. [2024-11-19 00:05:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 00:05:53,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2024-11-19 00:05:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:53,674 INFO L225 Difference]: With dead ends: 42941 [2024-11-19 00:05:53,674 INFO L226 Difference]: Without dead ends: 30359 [2024-11-19 00:05:53,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:05:53,707 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 439 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:53,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1937 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:05:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30359 states. [2024-11-19 00:05:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30359 to 22641. [2024-11-19 00:05:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22641 states, 21388 states have (on average 1.6351224985973443) internal successors, (34972), 21464 states have internal predecessors, (34972), 1164 states have call successors, (1164), 88 states have call predecessors, (1164), 88 states have return successors, (1164), 1088 states have call predecessors, (1164), 1164 states have call successors, (1164) [2024-11-19 00:05:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22641 states to 22641 states and 37300 transitions. [2024-11-19 00:05:54,379 INFO L78 Accepts]: Start accepts. Automaton has 22641 states and 37300 transitions. Word has length 460 [2024-11-19 00:05:54,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:54,380 INFO L471 AbstractCegarLoop]: Abstraction has 22641 states and 37300 transitions. [2024-11-19 00:05:54,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:54,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22641 states and 37300 transitions. [2024-11-19 00:05:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:54,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:54,417 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:54,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 00:05:54,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:54,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 670873910, now seen corresponding path program 1 times [2024-11-19 00:05:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371813341] [2024-11-19 00:05:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:05:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:05:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:05:56,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:05:56,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371813341] [2024-11-19 00:05:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371813341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:05:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:05:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 00:05:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904664799] [2024-11-19 00:05:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:05:56,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:05:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:05:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:05:56,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:05:56,755 INFO L87 Difference]: Start difference. First operand 22641 states and 37300 transitions. Second operand has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:05:58,417 INFO L93 Difference]: Finished difference Result 92649 states and 153437 transitions. [2024-11-19 00:05:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:05:58,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2024-11-19 00:05:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:05:58,557 INFO L225 Difference]: With dead ends: 92649 [2024-11-19 00:05:58,557 INFO L226 Difference]: Without dead ends: 70011 [2024-11-19 00:05:58,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-19 00:05:58,611 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 2753 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2753 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:05:58,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2753 Valid, 2955 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 00:05:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70011 states. [2024-11-19 00:05:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70011 to 39722. [2024-11-19 00:05:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39722 states, 38400 states have (on average 1.6435416666666667) internal successors, (63112), 38476 states have internal predecessors, (63112), 1230 states have call successors, (1230), 91 states have call predecessors, (1230), 91 states have return successors, (1230), 1154 states have call predecessors, (1230), 1230 states have call successors, (1230) [2024-11-19 00:05:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39722 states to 39722 states and 65572 transitions. [2024-11-19 00:05:59,583 INFO L78 Accepts]: Start accepts. Automaton has 39722 states and 65572 transitions. Word has length 460 [2024-11-19 00:05:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:05:59,584 INFO L471 AbstractCegarLoop]: Abstraction has 39722 states and 65572 transitions. [2024-11-19 00:05:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:05:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39722 states and 65572 transitions. [2024-11-19 00:05:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:05:59,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:05:59,637 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:05:59,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 00:05:59,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:05:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:05:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash -331119274, now seen corresponding path program 1 times [2024-11-19 00:05:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:05:59,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319618663] [2024-11-19 00:05:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:05:59,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:06:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319618663] [2024-11-19 00:06:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319618663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:01,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:06:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368402899] [2024-11-19 00:06:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:01,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:06:01,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:06:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:06:01,499 INFO L87 Difference]: Start difference. First operand 39722 states and 65572 transitions. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:06:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:03,118 INFO L93 Difference]: Finished difference Result 116867 states and 192485 transitions. [2024-11-19 00:06:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 00:06:03,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) Word has length 460 [2024-11-19 00:06:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:03,264 INFO L225 Difference]: With dead ends: 116867 [2024-11-19 00:06:03,265 INFO L226 Difference]: Without dead ends: 78069 [2024-11-19 00:06:03,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:06:03,314 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 1818 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:03,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 3045 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 00:06:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78069 states. [2024-11-19 00:06:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78069 to 58152. [2024-11-19 00:06:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58152 states, 56030 states have (on average 1.6339817954667142) internal successors, (91552), 56186 states have internal predecessors, (91552), 1950 states have call successors, (1950), 171 states have call predecessors, (1950), 171 states have return successors, (1950), 1794 states have call predecessors, (1950), 1950 states have call successors, (1950) [2024-11-19 00:06:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58152 states to 58152 states and 95452 transitions. [2024-11-19 00:06:04,569 INFO L78 Accepts]: Start accepts. Automaton has 58152 states and 95452 transitions. Word has length 460 [2024-11-19 00:06:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 58152 states and 95452 transitions. [2024-11-19 00:06:04,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:06:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 58152 states and 95452 transitions. [2024-11-19 00:06:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:06:04,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:04,985 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:06:04,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 00:06:04,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:04,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1139937739, now seen corresponding path program 1 times [2024-11-19 00:06:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54158077] [2024-11-19 00:06:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:06:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:06,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54158077] [2024-11-19 00:06:06,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54158077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:06,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 00:06:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50243054] [2024-11-19 00:06:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:06,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 00:06:06,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 00:06:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 00:06:06,799 INFO L87 Difference]: Start difference. First operand 58152 states and 95452 transitions. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:06:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:10,280 INFO L93 Difference]: Finished difference Result 172480 states and 282787 transitions. [2024-11-19 00:06:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:06:10,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) Word has length 460 [2024-11-19 00:06:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:10,584 INFO L225 Difference]: With dead ends: 172480 [2024-11-19 00:06:10,585 INFO L226 Difference]: Without dead ends: 133342 [2024-11-19 00:06:10,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:06:10,620 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 3868 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3868 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:10,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3868 Valid, 2655 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 00:06:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133342 states. [2024-11-19 00:06:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133342 to 52042. [2024-11-19 00:06:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52042 states, 50080 states have (on average 1.6340654952076676) internal successors, (81834), 50220 states have internal predecessors, (81834), 1806 states have call successors, (1806), 155 states have call predecessors, (1806), 155 states have return successors, (1806), 1666 states have call predecessors, (1806), 1806 states have call successors, (1806) [2024-11-19 00:06:12,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52042 states to 52042 states and 85446 transitions. [2024-11-19 00:06:12,370 INFO L78 Accepts]: Start accepts. Automaton has 52042 states and 85446 transitions. Word has length 460 [2024-11-19 00:06:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:12,371 INFO L471 AbstractCegarLoop]: Abstraction has 52042 states and 85446 transitions. [2024-11-19 00:06:12,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 2 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 2 states have call predecessors, (66), 2 states have call successors, (66) [2024-11-19 00:06:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 52042 states and 85446 transitions. [2024-11-19 00:06:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:06:12,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:12,419 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:06:12,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 00:06:12,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:12,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1105641715, now seen corresponding path program 1 times [2024-11-19 00:06:12,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:12,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423135046] [2024-11-19 00:06:12,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:12,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:19,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:06:19,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:19,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423135046] [2024-11-19 00:06:19,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423135046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:06:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106567348] [2024-11-19 00:06:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:19,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:06:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:06:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:06:19,405 INFO L87 Difference]: Start difference. First operand 52042 states and 85446 transitions. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 4 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-11-19 00:06:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:06:21,136 INFO L93 Difference]: Finished difference Result 117891 states and 193757 transitions. [2024-11-19 00:06:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:06:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 4 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) Word has length 460 [2024-11-19 00:06:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:06:21,273 INFO L225 Difference]: With dead ends: 117891 [2024-11-19 00:06:21,273 INFO L226 Difference]: Without dead ends: 82957 [2024-11-19 00:06:21,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:06:21,338 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 2576 mSDsluCounter, 2673 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2576 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:06:21,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2576 Valid, 3186 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 00:06:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82957 states. [2024-11-19 00:06:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82957 to 52882. [2024-11-19 00:06:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52882 states, 50920 states have (on average 1.6357030636292222) internal successors, (83290), 51060 states have internal predecessors, (83290), 1806 states have call successors, (1806), 155 states have call predecessors, (1806), 155 states have return successors, (1806), 1666 states have call predecessors, (1806), 1806 states have call successors, (1806) [2024-11-19 00:06:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52882 states to 52882 states and 86902 transitions. [2024-11-19 00:06:22,579 INFO L78 Accepts]: Start accepts. Automaton has 52882 states and 86902 transitions. Word has length 460 [2024-11-19 00:06:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:06:22,580 INFO L471 AbstractCegarLoop]: Abstraction has 52882 states and 86902 transitions. [2024-11-19 00:06:22,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 4 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 4 states have call predecessors, (66), 4 states have call successors, (66) [2024-11-19 00:06:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52882 states and 86902 transitions. [2024-11-19 00:06:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-19 00:06:23,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:06:23,032 INFO L215 NwaCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:06:23,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 00:06:23,033 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:06:23,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:06:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash 480171059, now seen corresponding path program 1 times [2024-11-19 00:06:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:06:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220022226] [2024-11-19 00:06:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:06:23,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:06:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:06:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8580 trivial. 0 not checked. [2024-11-19 00:06:24,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:06:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220022226] [2024-11-19 00:06:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220022226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:06:24,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:06:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:06:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537303278] [2024-11-19 00:06:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:06:24,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 00:06:24,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:06:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 00:06:24,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:06:24,441 INFO L87 Difference]: Start difference. First operand 52882 states and 86902 transitions. Second operand has 12 states, 12 states have (on average 11.083333333333334) internal successors, (133), 12 states have internal predecessors, (133), 1 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 1 states have call predecessors, (66), 1 states have call successors, (66) [2024-11-19 00:06:30,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:34,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:38,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:42,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:46,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:50,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-19 00:06:54,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []