./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.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 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:12:48,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:12:48,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:12:48,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:12:48,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:12:48,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:12:48,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:12:48,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:12:48,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:12:48,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:12:48,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:12:48,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:12:48,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:12:48,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:12:48,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:12:48,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:12:48,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:12:48,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:12:48,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:12:48,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:12:48,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:12:48,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:12:48,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:12:48,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:12:48,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:12:48,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:12:48,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:12:48,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:12:48,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:12:48,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:12:48,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:12:48,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:12:48,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:12:48,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:12:48,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:12:48,339 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:12:48,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:12:48,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:12:48,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:12:48,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:12:48,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:12:48,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:12:48,345 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 -> 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 [2024-11-09 02:12:48,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:12:48,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:12:48,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:12:48,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:12:48,580 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:12:48,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-09 02:12:49,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:12:49,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:12:49,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-09 02:12:49,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2c92bac/4a369c9642b1437f907d64e3012033fb/FLAG8a4287eef [2024-11-09 02:12:50,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc2c92bac/4a369c9642b1437f907d64e3012033fb [2024-11-09 02:12:50,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:12:50,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:12:50,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:12:50,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:12:50,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:12:50,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49998499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50, skipping insertion in model container [2024-11-09 02:12:50,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:12:50,546 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2024-11-09 02:12:50,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:12:50,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:12:50,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2024-11-09 02:12:50,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:12:50,684 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:12:50,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50 WrapperNode [2024-11-09 02:12:50,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:12:50,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:12:50,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:12:50,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:12:50,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,761 INFO L138 Inliner]: procedures = 30, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 612 [2024-11-09 02:12:50,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:12:50,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:12:50,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:12:50,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:12:50,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,788 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:12:50,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:12:50,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:12:50,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:12:50,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:12:50,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (1/1) ... [2024-11-09 02:12:50,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:12:50,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:12:50,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:12:50,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:12:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:12:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:12:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:12:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:12:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:12:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:12:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:12:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:12:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:12:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:12:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:12:50,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:12:50,995 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:12:50,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:12:51,417 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-11-09 02:12:51,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:12:51,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:12:51,433 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:12:51,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:51 BoogieIcfgContainer [2024-11-09 02:12:51,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:12:51,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:12:51,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:12:51,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:12:51,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:12:50" (1/3) ... [2024-11-09 02:12:51,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:51, skipping insertion in model container [2024-11-09 02:12:51,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:12:50" (2/3) ... [2024-11-09 02:12:51,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:12:51, skipping insertion in model container [2024-11-09 02:12:51,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:12:51" (3/3) ... [2024-11-09 02:12:51,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-39.i [2024-11-09 02:12:51,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:12:51,452 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:12:51,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:12:51,500 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;@d27fb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:12:51,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:12:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:12:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:12:51,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:51,513 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:51,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:51,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 276579875, now seen corresponding path program 1 times [2024-11-09 02:12:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:51,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19066249] [2024-11-09 02:12:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:51,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:12:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:12:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:12:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:12:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:12:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:51,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19066249] [2024-11-09 02:12:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19066249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:12:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441250419] [2024-11-09 02:12:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:51,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:12:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:51,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:12:51,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:12:51,890 INFO L87 Difference]: Start difference. First operand has 120 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:51,936 INFO L93 Difference]: Finished difference Result 233 states and 364 transitions. [2024-11-09 02:12:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:12:51,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 02:12:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:51,943 INFO L225 Difference]: With dead ends: 233 [2024-11-09 02:12:51,943 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:12:51,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:12:51,949 INFO L432 NwaCegarLoop]: 170 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, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:51,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:12:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:12:51,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 02:12:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:12:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2024-11-09 02:12:51,985 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2024-11-09 02:12:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:51,986 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2024-11-09 02:12:51,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2024-11-09 02:12:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:12:51,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:51,988 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:12:51,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 534061159, now seen corresponding path program 1 times [2024-11-09 02:12:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644908806] [2024-11-09 02:12:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:12:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:12:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:12:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:12:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:12:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644908806] [2024-11-09 02:12:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644908806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:12:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117242025] [2024-11-09 02:12:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:52,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:12:52,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:52,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:12:52,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:12:52,308 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:52,359 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2024-11-09 02:12:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:12:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 02:12:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:52,361 INFO L225 Difference]: With dead ends: 231 [2024-11-09 02:12:52,362 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 02:12:52,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:12:52,363 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:52,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:12:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 02:12:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 02:12:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:12:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2024-11-09 02:12:52,379 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 128 [2024-11-09 02:12:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:52,380 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2024-11-09 02:12:52,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2024-11-09 02:12:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:12:52,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:52,382 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:52,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:12:52,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:52,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash -726856091, now seen corresponding path program 1 times [2024-11-09 02:12:52,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:52,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589979954] [2024-11-09 02:12:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:52,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:12:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:12:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:12:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:12:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:12:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:12:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:12:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:12:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:12:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:12:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:12:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:12:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:12:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:12:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:12:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:12:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:12:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:12:54,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:12:54,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589979954] [2024-11-09 02:12:54,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589979954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:12:54,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:12:54,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:12:54,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488211159] [2024-11-09 02:12:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:12:54,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:12:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:12:54,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:12:54,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:12:54,986 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:12:55,747 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2024-11-09 02:12:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:12:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 02:12:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:12:55,751 INFO L225 Difference]: With dead ends: 305 [2024-11-09 02:12:55,751 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 02:12:55,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:12:55,754 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 392 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:12:55,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 322 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:12:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 02:12:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2024-11-09 02:12:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 164 states have (on average 1.420731707317073) internal successors, (233), 165 states have internal predecessors, (233), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:12:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 273 transitions. [2024-11-09 02:12:55,787 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 273 transitions. Word has length 128 [2024-11-09 02:12:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:12:55,788 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 273 transitions. [2024-11-09 02:12:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:12:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 273 transitions. [2024-11-09 02:12:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:12:55,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:12:55,790 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:12:55,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:12:55,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:12:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:12:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1406914461, now seen corresponding path program 1 times [2024-11-09 02:12:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:12:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606461690] [2024-11-09 02:12:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:12:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:12:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:13:01,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606461690] [2024-11-09 02:13:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606461690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 02:13:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865650884] [2024-11-09 02:13:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:01,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:13:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:13:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:13:01,616 INFO L87 Difference]: Start difference. First operand 187 states and 273 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 02:13:04,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:04,754 INFO L93 Difference]: Finished difference Result 466 states and 679 transitions. [2024-11-09 02:13:04,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 02:13:04,756 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2024-11-09 02:13:04,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:04,761 INFO L225 Difference]: With dead ends: 466 [2024-11-09 02:13:04,762 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 02:13:04,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-11-09 02:13:04,767 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 506 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:04,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1238 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 02:13:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 02:13:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 195. [2024-11-09 02:13:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 173 states have internal predecessors, (243), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:13:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2024-11-09 02:13:04,795 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 128 [2024-11-09 02:13:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:04,797 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2024-11-09 02:13:04,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-09 02:13:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2024-11-09 02:13:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:13:04,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:04,800 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:04,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:13:04,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:04,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1979763303, now seen corresponding path program 1 times [2024-11-09 02:13:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:04,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551839955] [2024-11-09 02:13:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:04,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:13:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:13:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:13:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:13:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:13:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:13:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:13:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:13:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:13:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:13:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:13:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:13:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-09 02:13:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551839955] [2024-11-09 02:13:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551839955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786104565] [2024-11-09 02:13:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:13:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:10,320 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-09 02:13:10,322 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-09 02:13:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:10,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-11-09 02:13:10,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:10,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:13:12,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-09 02:13:13,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 02:13:13,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-09 02:13:14,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-09 02:13:14,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-09 02:13:15,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-09 02:13:15,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-09 02:13:16,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2024-11-09 02:13:17,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 102 [2024-11-09 02:13:17,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:17,665 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 02:13:17,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 120 [2024-11-09 02:13:18,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,526 INFO L349 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2024-11-09 02:13:18,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 108 [2024-11-09 02:13:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:18,913 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-11-09 02:13:18,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 100 [2024-11-09 02:13:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 154 proven. 223 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-11-09 02:13:19,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:13:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786104565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:51,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:13:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32] total 50 [2024-11-09 02:13:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397114602] [2024-11-09 02:13:51,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:13:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 02:13:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 02:13:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3327, Unknown=2, NotChecked=0, Total=3660 [2024-11-09 02:13:51,791 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 50 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 12 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) [2024-11-09 02:14:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:04,263 INFO L93 Difference]: Finished difference Result 556 states and 787 transitions. [2024-11-09 02:14:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 02:14:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 12 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) Word has length 128 [2024-11-09 02:14:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:04,269 INFO L225 Difference]: With dead ends: 556 [2024-11-09 02:14:04,269 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 02:14:04,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2785 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=1541, Invalid=9587, Unknown=2, NotChecked=0, Total=11130 [2024-11-09 02:14:04,272 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1042 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 4632 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 4632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:04,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 2705 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 4632 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-09 02:14:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 02:14:04,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 244. [2024-11-09 02:14:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 214 states have (on average 1.3831775700934579) internal successors, (296), 215 states have internal predecessors, (296), 20 states have call successors, (20), 9 states have call predecessors, (20), 9 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 02:14:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 336 transitions. [2024-11-09 02:14:04,299 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 336 transitions. Word has length 128 [2024-11-09 02:14:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:04,299 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 336 transitions. [2024-11-09 02:14:04,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 45 states have (on average 2.577777777777778) internal successors, (116), 46 states have internal predecessors, (116), 12 states have call successors, (32), 7 states have call predecessors, (32), 9 states have return successors, (32), 9 states have call predecessors, (32), 12 states have call successors, (32) [2024-11-09 02:14:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 336 transitions. [2024-11-09 02:14:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:14:04,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:04,301 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:04,316 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-09 02:14:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:14:04,502 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1299704933, now seen corresponding path program 1 times [2024-11-09 02:14:04,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:04,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658763465] [2024-11-09 02:14:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:14:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:14:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:14:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:14:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:14:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:14:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:14:06,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658763465] [2024-11-09 02:14:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658763465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:06,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:06,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:14:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407605201] [2024-11-09 02:14:06,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:06,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:14:06,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:06,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:14:06,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:14:06,103 INFO L87 Difference]: Start difference. First operand 244 states and 336 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:14:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:07,212 INFO L93 Difference]: Finished difference Result 494 states and 676 transitions. [2024-11-09 02:14:07,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:14:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2024-11-09 02:14:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:07,214 INFO L225 Difference]: With dead ends: 494 [2024-11-09 02:14:07,214 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 02:14:07,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:14:07,215 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 321 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:07,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 638 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:14:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 02:14:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 189. [2024-11-09 02:14:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 166 states have (on average 1.3855421686746987) internal successors, (230), 166 states have internal predecessors, (230), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 02:14:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 262 transitions. [2024-11-09 02:14:07,240 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 262 transitions. Word has length 128 [2024-11-09 02:14:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 262 transitions. [2024-11-09 02:14:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 02:14:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 262 transitions. [2024-11-09 02:14:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:14:07,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:07,242 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:14:07,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:14:07,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:07,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:07,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1356234675, now seen corresponding path program 1 times [2024-11-09 02:14:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:14:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669192391] [2024-11-09 02:14:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:14:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:14:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:14:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:14:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:14:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:14:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:14:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:14:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:14:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:14:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:14:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:14:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:14:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:14:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:14:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:14:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 02:14:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 02:14:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:14:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669192391] [2024-11-09 02:14:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669192391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:11,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:11,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 02:14:11,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453687016] [2024-11-09 02:14:11,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:11,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 02:14:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:14:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 02:14:11,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:14:11,931 INFO L87 Difference]: Start difference. First operand 189 states and 262 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)