./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/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/eca-rers2012/Problem01_label36.c -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.graphml --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 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:58:05,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:58:05,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:58:05,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:58:05,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:58:05,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:58:05,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:58:05,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:58:05,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:58:05,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:58:05,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:58:05,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:58:05,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:58:05,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:58:05,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:58:05,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:58:05,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:58:05,938 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:58:05,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:58:05,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:58:05,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:58:05,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:58:05,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:58:05,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:58:05,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:58:05,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:58:05,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:58:05,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:58:05,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:58:05,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:58:05,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:58:05,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:58:05,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:58:05,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:58:05,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:58:05,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:58:05,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:58:05,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:58:05,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:58:05,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:58:05,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:58:05,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:58:05,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:58:05,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:58:05,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:58:05,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:58:05,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:58:05,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:58:05,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:58:05,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:58:05,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:58:05,989 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:58:05,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:58:05,990 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:58:05,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:58:05,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:58:05,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:58:05,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:58:05,991 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:58:05,991 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:58:05,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:58:05,992 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:58:05,992 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:58:05,992 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:58:05,992 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:58:05,992 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:58:05,993 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c [2022-07-11 23:58:06,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:58:06,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:58:06,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:58:06,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:58:06,173 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:58:06,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2022-07-11 23:58:06,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edf43b88/14f4baa43f9b47de9cf9a7f95495de75/FLAG3890c8d53 [2022-07-11 23:58:06,704 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:58:06,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2022-07-11 23:58:06,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edf43b88/14f4baa43f9b47de9cf9a7f95495de75/FLAG3890c8d53 [2022-07-11 23:58:06,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8edf43b88/14f4baa43f9b47de9cf9a7f95495de75 [2022-07-11 23:58:06,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:58:06,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:58:06,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:58:06,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:58:06,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:58:06,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:58:06" (1/1) ... [2022-07-11 23:58:06,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670c532a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:06, skipping insertion in model container [2022-07-11 23:58:06,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:58:06" (1/1) ... [2022-07-11 23:58:06,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:58:06,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:58:07,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c[18233,18246] [2022-07-11 23:58:07,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:58:07,110 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:58:07,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c[18233,18246] [2022-07-11 23:58:07,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:58:07,194 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:58:07,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07 WrapperNode [2022-07-11 23:58:07,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:58:07,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:58:07,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:58:07,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:58:07,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,267 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 657 [2022-07-11 23:58:07,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:58:07,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:58:07,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:58:07,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:58:07,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:58:07,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:58:07,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:58:07,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:58:07,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (1/1) ... [2022-07-11 23:58:07,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:58:07,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:07,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:58:07,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:58:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:58:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:58:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:58:07,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:58:07,467 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:58:07,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:58:08,072 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:58:08,077 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:58:08,078 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:58:08,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:58:08 BoogieIcfgContainer [2022-07-11 23:58:08,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:58:08,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:58:08,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:58:08,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:58:08,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:58:06" (1/3) ... [2022-07-11 23:58:08,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d1d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:58:08, skipping insertion in model container [2022-07-11 23:58:08,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:58:07" (2/3) ... [2022-07-11 23:58:08,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d1d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:58:08, skipping insertion in model container [2022-07-11 23:58:08,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:58:08" (3/3) ... [2022-07-11 23:58:08,099 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label36.c [2022-07-11 23:58:08,108 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:58:08,123 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:58:08,176 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:58:08,188 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42776622, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ce5385b [2022-07-11 23:58:08,188 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:58:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-11 23:58:08,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:08,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:08,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2059373479, now seen corresponding path program 1 times [2022-07-11 23:58:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:08,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172118269] [2022-07-11 23:58:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172118269] [2022-07-11 23:58:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172118269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:08,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:58:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116103988] [2022-07-11 23:58:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:08,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:08,537 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:09,050 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-07-11 23:58:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-07-11 23:58:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:09,059 INFO L225 Difference]: With dead ends: 528 [2022-07-11 23:58:09,059 INFO L226 Difference]: Without dead ends: 266 [2022-07-11 23:58:09,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:09,064 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:09,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:58:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-11 23:58:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-07-11 23:58:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-07-11 23:58:09,101 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 102 [2022-07-11 23:58:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:09,101 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-07-11 23:58:09,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,102 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-07-11 23:58:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-11 23:58:09,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:09,105 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:58:09,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1045586682, now seen corresponding path program 1 times [2022-07-11 23:58:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750256368] [2022-07-11 23:58:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:09,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:09,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750256368] [2022-07-11 23:58:09,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750256368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:09,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:09,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:58:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190605356] [2022-07-11 23:58:09,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:09,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:09,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:09,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:09,150 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:09,447 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-07-11 23:58:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:09,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-07-11 23:58:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:09,449 INFO L225 Difference]: With dead ends: 792 [2022-07-11 23:58:09,449 INFO L226 Difference]: Without dead ends: 528 [2022-07-11 23:58:09,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:09,451 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:09,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:58:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-07-11 23:58:09,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-07-11 23:58:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2022-07-11 23:58:09,466 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 108 [2022-07-11 23:58:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:09,466 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2022-07-11 23:58:09,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2022-07-11 23:58:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-11 23:58:09,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:09,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:09,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:58:09,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:09,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1471586822, now seen corresponding path program 1 times [2022-07-11 23:58:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:09,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361676789] [2022-07-11 23:58:09,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:09,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:09,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361676789] [2022-07-11 23:58:09,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361676789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:09,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:09,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253721581] [2022-07-11 23:58:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:09,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:09,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:09,629 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:10,094 INFO L93 Difference]: Finished difference Result 1411 states and 1882 transitions. [2022-07-11 23:58:10,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:10,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-11 23:58:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:10,097 INFO L225 Difference]: With dead ends: 1411 [2022-07-11 23:58:10,097 INFO L226 Difference]: Without dead ends: 790 [2022-07-11 23:58:10,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:10,098 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:10,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 81 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:58:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-07-11 23:58:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2022-07-11 23:58:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.1634980988593155) internal successors, (918), 789 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 918 transitions. [2022-07-11 23:58:10,114 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 918 transitions. Word has length 109 [2022-07-11 23:58:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:10,114 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 918 transitions. [2022-07-11 23:58:10,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,114 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 918 transitions. [2022-07-11 23:58:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-11 23:58:10,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:10,118 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:58:10,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -157225395, now seen corresponding path program 1 times [2022-07-11 23:58:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249352885] [2022-07-11 23:58:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:58:10,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:10,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249352885] [2022-07-11 23:58:10,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249352885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:10,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:10,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:58:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328181366] [2022-07-11 23:58:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:10,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:10,178 INFO L87 Difference]: Start difference. First operand 790 states and 918 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:10,424 INFO L93 Difference]: Finished difference Result 1578 states and 1859 transitions. [2022-07-11 23:58:10,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:10,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-11 23:58:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:10,427 INFO L225 Difference]: With dead ends: 1578 [2022-07-11 23:58:10,427 INFO L226 Difference]: Without dead ends: 921 [2022-07-11 23:58:10,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:10,429 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:10,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:58:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-07-11 23:58:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-07-11 23:58:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1532608695652173) internal successors, (1061), 920 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1061 transitions. [2022-07-11 23:58:10,456 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1061 transitions. Word has length 114 [2022-07-11 23:58:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:10,456 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1061 transitions. [2022-07-11 23:58:10,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1061 transitions. [2022-07-11 23:58:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-11 23:58:10,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:10,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:10,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:58:10,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1991466069, now seen corresponding path program 1 times [2022-07-11 23:58:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:10,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751705096] [2022-07-11 23:58:10,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:58:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:10,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751705096] [2022-07-11 23:58:10,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751705096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:10,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:10,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828682274] [2022-07-11 23:58:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:10,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:10,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:10,525 INFO L87 Difference]: Start difference. First operand 921 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:10,800 INFO L93 Difference]: Finished difference Result 2364 states and 2732 transitions. [2022-07-11 23:58:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-11 23:58:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:10,804 INFO L225 Difference]: With dead ends: 2364 [2022-07-11 23:58:10,804 INFO L226 Difference]: Without dead ends: 1576 [2022-07-11 23:58:10,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:10,806 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:10,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 19 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:58:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2022-07-11 23:58:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2022-07-11 23:58:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1505922165820643) internal successors, (1360), 1182 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1360 transitions. [2022-07-11 23:58:10,834 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1360 transitions. Word has length 123 [2022-07-11 23:58:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:10,834 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1360 transitions. [2022-07-11 23:58:10,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1360 transitions. [2022-07-11 23:58:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-11 23:58:10,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:10,838 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:10,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:58:10,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1453681636, now seen corresponding path program 1 times [2022-07-11 23:58:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:10,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770596687] [2022-07-11 23:58:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:58:10,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:10,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770596687] [2022-07-11 23:58:10,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770596687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:10,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:10,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994732729] [2022-07-11 23:58:10,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:10,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:10,884 INFO L87 Difference]: Start difference. First operand 1183 states and 1360 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:11,276 INFO L93 Difference]: Finished difference Result 2495 states and 2925 transitions. [2022-07-11 23:58:11,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-11 23:58:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:11,280 INFO L225 Difference]: With dead ends: 2495 [2022-07-11 23:58:11,280 INFO L226 Difference]: Without dead ends: 1445 [2022-07-11 23:58:11,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:11,282 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:11,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 34 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:58:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-07-11 23:58:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2022-07-11 23:58:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.144736842105263) internal successors, (1653), 1444 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1653 transitions. [2022-07-11 23:58:11,306 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1653 transitions. Word has length 129 [2022-07-11 23:58:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:11,306 INFO L495 AbstractCegarLoop]: Abstraction has 1445 states and 1653 transitions. [2022-07-11 23:58:11,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1653 transitions. [2022-07-11 23:58:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-11 23:58:11,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:11,310 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:11,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:58:11,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1636914809, now seen corresponding path program 1 times [2022-07-11 23:58:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:11,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222705066] [2022-07-11 23:58:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:58:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:11,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222705066] [2022-07-11 23:58:11,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222705066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:11,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:11,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:11,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628673150] [2022-07-11 23:58:11,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:11,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:11,392 INFO L87 Difference]: Start difference. First operand 1445 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:11,768 INFO L93 Difference]: Finished difference Result 3281 states and 3775 transitions. [2022-07-11 23:58:11,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:11,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-07-11 23:58:11,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:11,773 INFO L225 Difference]: With dead ends: 3281 [2022-07-11 23:58:11,773 INFO L226 Difference]: Without dead ends: 1969 [2022-07-11 23:58:11,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:11,774 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 371 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:11,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 42 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:58:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-07-11 23:58:11,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-07-11 23:58:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.136091453456723) internal successors, (2087), 1837 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2087 transitions. [2022-07-11 23:58:11,798 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2087 transitions. Word has length 143 [2022-07-11 23:58:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:11,798 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2087 transitions. [2022-07-11 23:58:11,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2087 transitions. [2022-07-11 23:58:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-11 23:58:11,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:11,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:11,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:58:11,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:11,801 INFO L85 PathProgramCache]: Analyzing trace with hash -359253316, now seen corresponding path program 1 times [2022-07-11 23:58:11,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:11,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063377205] [2022-07-11 23:58:11,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:58:11,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:11,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063377205] [2022-07-11 23:58:11,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063377205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:11,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:11,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:11,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638358693] [2022-07-11 23:58:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:11,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:11,848 INFO L87 Difference]: Start difference. First operand 1838 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:12,207 INFO L93 Difference]: Finished difference Result 3805 states and 4312 transitions. [2022-07-11 23:58:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:12,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-07-11 23:58:12,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:12,213 INFO L225 Difference]: With dead ends: 3805 [2022-07-11 23:58:12,213 INFO L226 Difference]: Without dead ends: 2100 [2022-07-11 23:58:12,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:12,215 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 275 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:12,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 33 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:58:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-07-11 23:58:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2022-07-11 23:58:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.1295590636908002) internal successors, (2075), 1837 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2075 transitions. [2022-07-11 23:58:12,258 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2075 transitions. Word has length 160 [2022-07-11 23:58:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:12,259 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 2075 transitions. [2022-07-11 23:58:12,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2075 transitions. [2022-07-11 23:58:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-11 23:58:12,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:12,261 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:12,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:58:12,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 21711964, now seen corresponding path program 1 times [2022-07-11 23:58:12,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:12,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787397003] [2022-07-11 23:58:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:58:12,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:12,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787397003] [2022-07-11 23:58:12,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787397003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:12,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:12,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:58:12,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934983576] [2022-07-11 23:58:12,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:12,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:12,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:12,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:12,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:12,314 INFO L87 Difference]: Start difference. First operand 1838 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:12,572 INFO L93 Difference]: Finished difference Result 3936 states and 4452 transitions. [2022-07-11 23:58:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:12,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2022-07-11 23:58:12,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:12,577 INFO L225 Difference]: With dead ends: 3936 [2022-07-11 23:58:12,577 INFO L226 Difference]: Without dead ends: 2231 [2022-07-11 23:58:12,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:58:12,580 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:12,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 180 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:58:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-07-11 23:58:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2022-07-11 23:58:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.120057170080991) internal successors, (2351), 2099 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2351 transitions. [2022-07-11 23:58:12,607 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2351 transitions. Word has length 203 [2022-07-11 23:58:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:12,607 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 2351 transitions. [2022-07-11 23:58:12,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2351 transitions. [2022-07-11 23:58:12,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-11 23:58:12,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:12,610 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:12,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:58:12,611 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:12,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:12,611 INFO L85 PathProgramCache]: Analyzing trace with hash -908217879, now seen corresponding path program 1 times [2022-07-11 23:58:12,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:12,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949363282] [2022-07-11 23:58:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 57 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949363282] [2022-07-11 23:58:12,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949363282] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:58:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530593045] [2022-07-11 23:58:12,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:12,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:12,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:12,756 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) [2022-07-11 23:58:12,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:58:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:12,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:58:12,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-11 23:58:13,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530593045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:13,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:58:13,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-11 23:58:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351038754] [2022-07-11 23:58:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:13,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:13,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:58:13,160 INFO L87 Difference]: Start difference. First operand 2100 states and 2351 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:13,432 INFO L93 Difference]: Finished difference Result 4198 states and 4700 transitions. [2022-07-11 23:58:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:13,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2022-07-11 23:58:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:13,437 INFO L225 Difference]: With dead ends: 4198 [2022-07-11 23:58:13,437 INFO L226 Difference]: Without dead ends: 2100 [2022-07-11 23:58:13,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:58:13,439 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:13,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 170 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:58:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-07-11 23:58:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2022-07-11 23:58:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.100609756097561) internal successors, (2166), 1968 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2166 transitions. [2022-07-11 23:58:13,462 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2166 transitions. Word has length 206 [2022-07-11 23:58:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:13,462 INFO L495 AbstractCegarLoop]: Abstraction has 1969 states and 2166 transitions. [2022-07-11 23:58:13,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2166 transitions. [2022-07-11 23:58:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-11 23:58:13,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:13,465 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:13,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:13,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-11 23:58:13,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:13,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -737855579, now seen corresponding path program 1 times [2022-07-11 23:58:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639073857] [2022-07-11 23:58:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 64 proven. 119 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:58:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:13,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639073857] [2022-07-11 23:58:13,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639073857] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:58:13,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796523568] [2022-07-11 23:58:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:13,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:13,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:13,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:58:13,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:58:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:13,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:58:13,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:58:14,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:14,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796523568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:14,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:58:14,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-11 23:58:14,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876757582] [2022-07-11 23:58:14,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:14,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:58:14,014 INFO L87 Difference]: Start difference. First operand 1969 states and 2166 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:14,273 INFO L93 Difference]: Finished difference Result 4329 states and 4757 transitions. [2022-07-11 23:58:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:14,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2022-07-11 23:58:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:14,278 INFO L225 Difference]: With dead ends: 4329 [2022-07-11 23:58:14,278 INFO L226 Difference]: Without dead ends: 2231 [2022-07-11 23:58:14,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:58:14,281 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:14,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 184 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:58:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-07-11 23:58:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2022-07-11 23:58:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.0809909480705098) internal successors, (2269), 2099 states have internal predecessors, (2269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2269 transitions. [2022-07-11 23:58:14,304 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2269 transitions. Word has length 225 [2022-07-11 23:58:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:14,304 INFO L495 AbstractCegarLoop]: Abstraction has 2100 states and 2269 transitions. [2022-07-11 23:58:14,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2269 transitions. [2022-07-11 23:58:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-07-11 23:58:14,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:14,307 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:14,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:14,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-11 23:58:14,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:14,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:14,524 INFO L85 PathProgramCache]: Analyzing trace with hash 326532960, now seen corresponding path program 1 times [2022-07-11 23:58:14,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:14,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650438010] [2022-07-11 23:58:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 67 proven. 122 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-11 23:58:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650438010] [2022-07-11 23:58:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650438010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:58:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196105094] [2022-07-11 23:58:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:14,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:14,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:14,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:58:14,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:58:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:14,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:58:14,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-11 23:58:14,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:14,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196105094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:14,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:58:14,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:58:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385216283] [2022-07-11 23:58:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:14,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:14,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:14,770 INFO L87 Difference]: Start difference. First operand 2100 states and 2269 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:15,015 INFO L93 Difference]: Finished difference Result 4198 states and 4536 transitions. [2022-07-11 23:58:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2022-07-11 23:58:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:15,020 INFO L225 Difference]: With dead ends: 4198 [2022-07-11 23:58:15,021 INFO L226 Difference]: Without dead ends: 2100 [2022-07-11 23:58:15,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:15,023 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:15,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 172 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:58:15,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-07-11 23:58:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2022-07-11 23:58:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0620577027762657) internal successors, (1951), 1837 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1951 transitions. [2022-07-11 23:58:15,046 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1951 transitions. Word has length 228 [2022-07-11 23:58:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:15,047 INFO L495 AbstractCegarLoop]: Abstraction has 1838 states and 1951 transitions. [2022-07-11 23:58:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1951 transitions. [2022-07-11 23:58:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-11 23:58:15,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:15,050 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:15,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:15,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:15,264 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:15,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:15,264 INFO L85 PathProgramCache]: Analyzing trace with hash -799899186, now seen corresponding path program 1 times [2022-07-11 23:58:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:58:15,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297776647] [2022-07-11 23:58:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:58:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 86 proven. 141 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-11 23:58:15,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:58:15,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297776647] [2022-07-11 23:58:15,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297776647] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:58:15,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773890470] [2022-07-11 23:58:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:58:15,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:58:15,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:58:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:15,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:58:15,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:15,618 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-11 23:58:15,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:15,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773890470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:15,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:58:15,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-11 23:58:15,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024944044] [2022-07-11 23:58:15,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:15,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:58:15,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:58:15,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:58:15,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:58:15,622 INFO L87 Difference]: Start difference. First operand 1838 states and 1951 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:15,861 INFO L93 Difference]: Finished difference Result 2231 states and 2360 transitions. [2022-07-11 23:58:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:58:15,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2022-07-11 23:58:15,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:15,862 INFO L225 Difference]: With dead ends: 2231 [2022-07-11 23:58:15,862 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:58:15,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:58:15,865 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:15,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 27 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:58:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:58:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:58:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:58:15,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2022-07-11 23:58:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:15,866 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:58:15,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:58:15,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:58:15,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:58:15,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:16,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:58:16,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:58:16,569 INFO L899 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-07-11 23:58:16,569 INFO L899 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-07-11 23:58:16,569 INFO L899 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-07-11 23:58:16,570 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-07-11 23:58:16,571 INFO L899 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-07-11 23:58:16,572 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,573 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-07-11 23:58:16,574 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-07-11 23:58:16,575 INFO L899 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-07-11 23:58:16,576 INFO L899 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-07-11 23:58:16,576 INFO L899 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-07-11 23:58:16,576 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-07-11 23:58:16,576 INFO L899 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-07-11 23:58:16,576 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,577 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-07-11 23:58:16,578 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-07-11 23:58:16,579 INFO L899 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-07-11 23:58:16,580 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-07-11 23:58:16,581 INFO L899 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-07-11 23:58:16,583 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L895 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse6 (<= 15 ~a8~0)) (.cse8 (<= 14 ~a8~0)) (.cse0 (<= ~a21~0 0)) (.cse4 (= ~a16~0 6)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a20~0 1)) (.cse3 (<= ~a20~0 0)) (.cse5 (= ~a21~0 1)) (.cse9 (<= ~a16~0 5)) (.cse1 (<= ~a16~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse6) (and .cse0 .cse7 .cse2) (and .cse3 .cse0 .cse7 .cse1) (and .cse3 .cse8 .cse5 .cse9) (and .cse8 .cse5 .cse9 .cse2) (and .cse4 .cse0 .cse2) (and .cse5 .cse1 .cse2) (and (= ~a12~0 8) .cse4 .cse5 .cse7 .cse2) (and .cse3 .cse5 .cse9 .cse1))) [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,584 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-07-11 23:58:16,585 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L902 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-07-11 23:58:16,586 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,587 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-07-11 23:58:16,588 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-07-11 23:58:16,589 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-07-11 23:58:16,589 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-07-11 23:58:16,589 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-07-11 23:58:16,589 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-07-11 23:58:16,589 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,590 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse6 (<= 15 ~a8~0)) (.cse8 (<= 14 ~a8~0)) (.cse0 (<= ~a21~0 0)) (.cse4 (= ~a16~0 6)) (.cse7 (= ~a17~0 1)) (.cse2 (= ~a20~0 1)) (.cse3 (<= ~a20~0 0)) (.cse5 (= ~a21~0 1)) (.cse9 (<= ~a16~0 5)) (.cse1 (<= ~a16~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse5 .cse2 .cse6) (and .cse0 .cse7 .cse2) (and .cse3 .cse0 .cse7 .cse1) (and .cse3 .cse8 .cse5 .cse9) (and .cse8 .cse5 .cse9 .cse2) (and .cse4 .cse0 .cse2) (and .cse5 .cse1 .cse2) (and (= ~a12~0 8) .cse4 .cse5 .cse7 .cse2) (and .cse3 .cse5 .cse9 .cse1))) [2022-07-11 23:58:16,590 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,590 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,590 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,590 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 492) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-07-11 23:58:16,591 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-07-11 23:58:16,592 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-07-11 23:58:16,596 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:16,598 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:58:16,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:58:16 BoogieIcfgContainer [2022-07-11 23:58:16,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:58:16,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:58:16,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:58:16,629 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:58:16,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:58:08" (3/4) ... [2022-07-11 23:58:16,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:58:16,648 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:58:16,649 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:58:16,650 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:58:16,650 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:58:16,725 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:58:16,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:58:16,726 INFO L158 Benchmark]: Toolchain (without parser) took 9982.74ms. Allocated memory was 157.3MB in the beginning and 283.1MB in the end (delta: 125.8MB). Free memory was 126.3MB in the beginning and 159.3MB in the end (delta: -33.0MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,726 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:58:16,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.52ms. Allocated memory is still 157.3MB. Free memory was 126.3MB in the beginning and 115.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.69ms. Allocated memory is still 157.3MB. Free memory was 115.1MB in the beginning and 108.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,728 INFO L158 Benchmark]: Boogie Preprocessor took 74.44ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,728 INFO L158 Benchmark]: RCFGBuilder took 736.13ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 119.0MB in the end (delta: -14.3MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,729 INFO L158 Benchmark]: TraceAbstraction took 8547.41ms. Allocated memory was 157.3MB in the beginning and 283.1MB in the end (delta: 125.8MB). Free memory was 117.8MB in the beginning and 169.8MB in the end (delta: -52.0MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,729 INFO L158 Benchmark]: Witness Printer took 97.16ms. Allocated memory is still 283.1MB. Free memory was 169.8MB in the beginning and 159.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:58:16,732 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 55.2MB in the beginning and 55.2MB in the end (delta: 44.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.52ms. Allocated memory is still 157.3MB. Free memory was 126.3MB in the beginning and 115.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.69ms. Allocated memory is still 157.3MB. Free memory was 115.1MB in the beginning and 108.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.44ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 736.13ms. Allocated memory is still 157.3MB. Free memory was 104.7MB in the beginning and 119.0MB in the end (delta: -14.3MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8547.41ms. Allocated memory was 157.3MB in the beginning and 283.1MB in the end (delta: 125.8MB). Free memory was 117.8MB in the beginning and 169.8MB in the end (delta: -52.0MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. * Witness Printer took 97.16ms. Allocated memory is still 283.1MB. Free memory was 169.8MB in the beginning and 159.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 492]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1766 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1766 mSDsluCounter, 1107 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 716 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4841 IncrementalHoareTripleChecker+Invalid, 5557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 716 mSolverCounterUnsat, 1024 mSDtfsCounter, 4841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 943 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 43 NumberOfFragments, 265 HoareAnnotationTreeSize, 3 FomulaSimplifications, 300 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1950 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3003 NumberOfCodeBlocks, 3003 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2986 ConstructedInterpolants, 0 QuantifiedInterpolants, 17389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1663 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1632/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((a21 <= 0 && a16 <= 4) && a20 == 1) || (((a20 <= 0 && a16 == 6) && a21 == 1) && 15 <= a8)) || ((a21 == 1 && a20 == 1) && 15 <= a8)) || ((a21 <= 0 && a17 == 1) && a20 == 1)) || (((a20 <= 0 && a21 <= 0) && a17 == 1) && a16 <= 4)) || (((a20 <= 0 && 14 <= a8) && a21 == 1) && a16 <= 5)) || (((14 <= a8 && a21 == 1) && a16 <= 5) && a20 == 1)) || ((a16 == 6 && a21 <= 0) && a20 == 1)) || ((a21 == 1 && a16 <= 4) && a20 == 1)) || ((((a12 == 8 && a16 == 6) && a21 == 1) && a17 == 1) && a20 == 1)) || (((a20 <= 0 && a21 == 1) && a16 <= 5) && a16 <= 4) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((a21 <= 0 && a16 <= 4) && a20 == 1) || (((a20 <= 0 && a16 == 6) && a21 == 1) && 15 <= a8)) || ((a21 == 1 && a20 == 1) && 15 <= a8)) || ((a21 <= 0 && a17 == 1) && a20 == 1)) || (((a20 <= 0 && a21 <= 0) && a17 == 1) && a16 <= 4)) || (((a20 <= 0 && 14 <= a8) && a21 == 1) && a16 <= 5)) || (((14 <= a8 && a21 == 1) && a16 <= 5) && a20 == 1)) || ((a16 == 6 && a21 <= 0) && a20 == 1)) || ((a21 == 1 && a16 <= 4) && a20 == 1)) || ((((a12 == 8 && a16 == 6) && a21 == 1) && a17 == 1) && a20 == 1)) || (((a20 <= 0 && a21 == 1) && a16 <= 5) && a16 <= 4) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:58:16,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE