./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label26.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/Problem11_label26.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 f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 00:56:49,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 00:56:49,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 00:56:49,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 00:56:49,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 00:56:49,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 00:56:49,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 00:56:49,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 00:56:49,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 00:56:49,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 00:56:49,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 00:56:49,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 00:56:49,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 00:56:49,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 00:56:49,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 00:56:49,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 00:56:49,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 00:56:49,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 00:56:49,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 00:56:49,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 00:56:49,902 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 00:56:49,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 00:56:49,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 00:56:49,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 00:56:49,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 00:56:49,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 00:56:49,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 00:56:49,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 00:56:49,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 00:56:49,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 00:56:49,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 00:56:49,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 00:56:49,910 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 00:56:49,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 00:56:49,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 00:56:49,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 00:56:49,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 00:56:49,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 00:56:49,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 00:56:49,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 00:56:49,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 00:56:49,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 00:56:49,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 00:56:49,944 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 00:56:49,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 00:56:49,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 00:56:49,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 00:56:49,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 00:56:49,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 00:56:49,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 00:56:49,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 00:56:49,947 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 00:56:49,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 00:56:49,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 00:56:49,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 00:56:49,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 00:56:49,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 00:56:49,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:56:49,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 00:56:49,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 00:56:49,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 00:56:49,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 00:56:49,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 00:56:49,951 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 00:56:49,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 00:56:49,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 00:56:49,951 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 -> f464de24b3032dee99022ecd3bac09be4532608b487d4a13c374cca55e302076 [2022-07-12 00:56:50,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 00:56:50,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 00:56:50,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 00:56:50,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 00:56:50,166 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 00:56:50,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2022-07-12 00:56:50,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df15c66c0/596d5286603e478784d8af3f88568354/FLAGbca801cf4 [2022-07-12 00:56:50,689 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 00:56:50,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label26.c [2022-07-12 00:56:50,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df15c66c0/596d5286603e478784d8af3f88568354/FLAGbca801cf4 [2022-07-12 00:56:50,724 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df15c66c0/596d5286603e478784d8af3f88568354 [2022-07-12 00:56:50,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 00:56:50,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 00:56:50,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 00:56:50,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 00:56:50,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 00:56:50,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:56:50" (1/1) ... [2022-07-12 00:56:50,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3b3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:50, skipping insertion in model container [2022-07-12 00:56:50,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:56:50" (1/1) ... [2022-07-12 00:56:50,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 00:56:50,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 00:56:50,985 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/Problem11_label26.c[5699,5712] [2022-07-12 00:56:51,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:56:51,136 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 00:56:51,162 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/Problem11_label26.c[5699,5712] [2022-07-12 00:56:51,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 00:56:51,298 INFO L208 MainTranslator]: Completed translation [2022-07-12 00:56:51,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51 WrapperNode [2022-07-12 00:56:51,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 00:56:51,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 00:56:51,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 00:56:51,300 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 00:56:51,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,401 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-07-12 00:56:51,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 00:56:51,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 00:56:51,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 00:56:51,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 00:56:51,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 00:56:51,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 00:56:51,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 00:56:51,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 00:56:51,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (1/1) ... [2022-07-12 00:56:51,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 00:56:51,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:56:51,540 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-12 00:56:51,557 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-12 00:56:51,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 00:56:51,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 00:56:51,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 00:56:51,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 00:56:51,625 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 00:56:51,627 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 00:56:52,782 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 00:56:52,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 00:56:52,794 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 00:56:52,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:52 BoogieIcfgContainer [2022-07-12 00:56:52,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 00:56:52,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 00:56:52,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 00:56:52,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 00:56:52,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:56:50" (1/3) ... [2022-07-12 00:56:52,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb45c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:56:52, skipping insertion in model container [2022-07-12 00:56:52,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:56:51" (2/3) ... [2022-07-12 00:56:52,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb45c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:56:52, skipping insertion in model container [2022-07-12 00:56:52,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:52" (3/3) ... [2022-07-12 00:56:52,802 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label26.c [2022-07-12 00:56:52,812 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 00:56:52,812 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 00:56:52,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 00:56:52,867 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@29944804, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46c2a108 [2022-07-12 00:56:52,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 00:56:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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-12 00:56:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 00:56:52,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:52,882 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] [2022-07-12 00:56:52,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:52,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2022-07-12 00:56:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087426258] [2022-07-12 00:56:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:53,116 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-12 00:56:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087426258] [2022-07-12 00:56:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087426258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:53,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198466101] [2022-07-12 00:56:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:53,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:53,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:53,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:53,148 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 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 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-12 00:56:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:54,036 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2022-07-12 00:56:54,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:54,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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 39 [2022-07-12 00:56:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:54,047 INFO L225 Difference]: With dead ends: 776 [2022-07-12 00:56:54,047 INFO L226 Difference]: Without dead ends: 413 [2022-07-12 00:56:54,050 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-12 00:56:54,052 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 188 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:54,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 00:56:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-12 00:56:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2022-07-12 00:56:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 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-12 00:56:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2022-07-12 00:56:54,096 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 39 [2022-07-12 00:56:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:54,096 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2022-07-12 00:56:54,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 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-12 00:56:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2022-07-12 00:56:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 00:56:54,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:54,099 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 00:56:54,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 00:56:54,099 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 142001080, now seen corresponding path program 1 times [2022-07-12 00:56:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:54,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115943979] [2022-07-12 00:56:54,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:54,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:54,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:54,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115943979] [2022-07-12 00:56:54,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115943979] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:54,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:54,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:54,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503562306] [2022-07-12 00:56:54,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:54,182 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-12 00:56:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:54,802 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2022-07-12 00:56:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:54,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2022-07-12 00:56:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:54,818 INFO L225 Difference]: With dead ends: 1209 [2022-07-12 00:56:54,819 INFO L226 Difference]: Without dead ends: 800 [2022-07-12 00:56:54,821 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-12 00:56:54,824 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:54,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:56:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-07-12 00:56:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2022-07-12 00:56:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 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-12 00:56:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2022-07-12 00:56:54,853 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 107 [2022-07-12 00:56:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:54,854 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2022-07-12 00:56:54,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-12 00:56:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2022-07-12 00:56:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 00:56:54,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:54,856 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 00:56:54,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 00:56:54,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:54,857 INFO L85 PathProgramCache]: Analyzing trace with hash 412464125, now seen corresponding path program 1 times [2022-07-12 00:56:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:54,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537325402] [2022-07-12 00:56:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:54,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537325402] [2022-07-12 00:56:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537325402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:54,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400259733] [2022-07-12 00:56:54,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:54,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:54,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:54,939 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-12 00:56:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:55,498 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2022-07-12 00:56:55,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-12 00:56:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:55,502 INFO L225 Difference]: With dead ends: 1942 [2022-07-12 00:56:55,502 INFO L226 Difference]: Without dead ends: 1157 [2022-07-12 00:56:55,502 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-12 00:56:55,503 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:55,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-12 00:56:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2022-07-12 00:56:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 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-12 00:56:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2022-07-12 00:56:55,525 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 109 [2022-07-12 00:56:55,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:55,525 INFO L495 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2022-07-12 00:56:55,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 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-12 00:56:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2022-07-12 00:56:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 00:56:55,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:55,527 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:56:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 00:56:55,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:55,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1192776204, now seen corresponding path program 1 times [2022-07-12 00:56:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:55,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76979712] [2022-07-12 00:56:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 00:56:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:55,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76979712] [2022-07-12 00:56:55,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76979712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:55,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:55,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:56:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043602950] [2022-07-12 00:56:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:55,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:55,650 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-12 00:56:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:56,205 INFO L93 Difference]: Finished difference Result 2502 states and 3336 transitions. [2022-07-12 00:56:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:56,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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 151 [2022-07-12 00:56:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:56,209 INFO L225 Difference]: With dead ends: 2502 [2022-07-12 00:56:56,209 INFO L226 Difference]: Without dead ends: 1532 [2022-07-12 00:56:56,211 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-12 00:56:56,211 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:56,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2022-07-12 00:56:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2022-07-12 00:56:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2612671456564337) internal successors, (1931), 1531 states have internal predecessors, (1931), 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-12 00:56:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1931 transitions. [2022-07-12 00:56:56,230 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1931 transitions. Word has length 151 [2022-07-12 00:56:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 1532 states and 1931 transitions. [2022-07-12 00:56:56,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 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-12 00:56:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1931 transitions. [2022-07-12 00:56:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 00:56:56,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:56,232 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:56:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 00:56:56,232 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1825758429, now seen corresponding path program 1 times [2022-07-12 00:56:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:56,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524217399] [2022-07-12 00:56:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 00:56:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:56,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524217399] [2022-07-12 00:56:56,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524217399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:56,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:56,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:56,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587311610] [2022-07-12 00:56:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:56,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:56,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:56,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:56,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:56,318 INFO L87 Difference]: Start difference. First operand 1532 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-12 00:56:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:56,853 INFO L93 Difference]: Finished difference Result 3644 states and 4735 transitions. [2022-07-12 00:56:56,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 166 [2022-07-12 00:56:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:56,860 INFO L225 Difference]: With dead ends: 3644 [2022-07-12 00:56:56,860 INFO L226 Difference]: Without dead ends: 2298 [2022-07-12 00:56:56,862 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-12 00:56:56,864 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 196 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:56,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2022-07-12 00:56:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2022-07-12 00:56:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2650392327811684) internal successors, (2902), 2294 states have internal predecessors, (2902), 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-12 00:56:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2902 transitions. [2022-07-12 00:56:56,894 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2902 transitions. Word has length 166 [2022-07-12 00:56:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:56,895 INFO L495 AbstractCegarLoop]: Abstraction has 2295 states and 2902 transitions. [2022-07-12 00:56:56,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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-12 00:56:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2902 transitions. [2022-07-12 00:56:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-12 00:56:56,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:56,900 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 00:56:56,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 00:56:56,901 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -890036000, now seen corresponding path program 1 times [2022-07-12 00:56:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:56,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610823638] [2022-07-12 00:56:56,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:56,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 00:56:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610823638] [2022-07-12 00:56:57,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610823638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:57,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:57,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408286773] [2022-07-12 00:56:57,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:57,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:57,028 INFO L87 Difference]: Start difference. First operand 2295 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 51.0) 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-12 00:56:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:57,601 INFO L93 Difference]: Finished difference Result 5509 states and 7126 transitions. [2022-07-12 00:56:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) 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 221 [2022-07-12 00:56:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:57,610 INFO L225 Difference]: With dead ends: 5509 [2022-07-12 00:56:57,610 INFO L226 Difference]: Without dead ends: 3400 [2022-07-12 00:56:57,612 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-12 00:56:57,613 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 168 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:57,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 347 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-12 00:56:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2022-07-12 00:56:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3399 states have (on average 1.2350691379817593) internal successors, (4198), 3399 states have internal predecessors, (4198), 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-12 00:56:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4198 transitions. [2022-07-12 00:56:57,655 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4198 transitions. Word has length 221 [2022-07-12 00:56:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:57,656 INFO L495 AbstractCegarLoop]: Abstraction has 3400 states and 4198 transitions. [2022-07-12 00:56:57,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) 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-12 00:56:57,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4198 transitions. [2022-07-12 00:56:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-07-12 00:56:57,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:57,658 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-12 00:56:57,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 00:56:57,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1786639215, now seen corresponding path program 1 times [2022-07-12 00:56:57,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:57,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243990969] [2022-07-12 00:56:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 00:56:57,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:57,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243990969] [2022-07-12 00:56:57,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243990969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:57,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:57,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643633921] [2022-07-12 00:56:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:57,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:57,730 INFO L87 Difference]: Start difference. First operand 3400 states and 4198 transitions. Second operand has 3 states, 3 states have (on average 51.0) 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-12 00:56:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:58,351 INFO L93 Difference]: Finished difference Result 7913 states and 9909 transitions. [2022-07-12 00:56:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:58,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) 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 227 [2022-07-12 00:56:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:58,363 INFO L225 Difference]: With dead ends: 7913 [2022-07-12 00:56:58,364 INFO L226 Difference]: Without dead ends: 4699 [2022-07-12 00:56:58,400 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-12 00:56:58,400 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 157 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:58,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 384 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:56:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2022-07-12 00:56:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4689. [2022-07-12 00:56:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4688 states have (on average 1.2137372013651877) internal successors, (5690), 4688 states have internal predecessors, (5690), 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-12 00:56:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 5690 transitions. [2022-07-12 00:56:58,459 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 5690 transitions. Word has length 227 [2022-07-12 00:56:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:58,459 INFO L495 AbstractCegarLoop]: Abstraction has 4689 states and 5690 transitions. [2022-07-12 00:56:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) 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-12 00:56:58,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 5690 transitions. [2022-07-12 00:56:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-07-12 00:56:58,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:58,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 00:56:58,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 00:56:58,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:58,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1830859079, now seen corresponding path program 1 times [2022-07-12 00:56:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:58,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420114253] [2022-07-12 00:56:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:58,546 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 00:56:58,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:58,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420114253] [2022-07-12 00:56:58,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420114253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:58,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:58,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760566297] [2022-07-12 00:56:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:58,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:58,549 INFO L87 Difference]: Start difference. First operand 4689 states and 5690 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-12 00:56:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:59,100 INFO L93 Difference]: Finished difference Result 10682 states and 13136 transitions. [2022-07-12 00:56:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 298 [2022-07-12 00:56:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:59,116 INFO L225 Difference]: With dead ends: 10682 [2022-07-12 00:56:59,117 INFO L226 Difference]: Without dead ends: 6179 [2022-07-12 00:56:59,122 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-12 00:56:59,123 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:59,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 344 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2022-07-12 00:56:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 5978. [2022-07-12 00:56:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5977 states have (on average 1.2007696168646478) internal successors, (7177), 5977 states have internal predecessors, (7177), 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-12 00:56:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 7177 transitions. [2022-07-12 00:56:59,212 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 7177 transitions. Word has length 298 [2022-07-12 00:56:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:59,213 INFO L495 AbstractCegarLoop]: Abstraction has 5978 states and 7177 transitions. [2022-07-12 00:56:59,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-12 00:56:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 7177 transitions. [2022-07-12 00:56:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-12 00:56:59,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:59,218 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-12 00:56:59,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 00:56:59,219 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 719890930, now seen corresponding path program 1 times [2022-07-12 00:56:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:59,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777983293] [2022-07-12 00:56:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:59,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:56:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-12 00:56:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:56:59,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777983293] [2022-07-12 00:56:59,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777983293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:56:59,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:56:59,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:56:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946521923] [2022-07-12 00:56:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:56:59,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:56:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:56:59,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:56:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:56:59,301 INFO L87 Difference]: Start difference. First operand 5978 states and 7177 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-12 00:56:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:56:59,801 INFO L93 Difference]: Finished difference Result 11739 states and 14076 transitions. [2022-07-12 00:56:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:56:59,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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 301 [2022-07-12 00:56:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:56:59,816 INFO L225 Difference]: With dead ends: 11739 [2022-07-12 00:56:59,816 INFO L226 Difference]: Without dead ends: 5763 [2022-07-12 00:56:59,822 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-12 00:56:59,823 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:56:59,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 151 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:56:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5763 states. [2022-07-12 00:56:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5763 to 5578. [2022-07-12 00:56:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5578 states, 5577 states have (on average 1.1468531468531469) internal successors, (6396), 5577 states have internal predecessors, (6396), 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-12 00:56:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5578 states to 5578 states and 6396 transitions. [2022-07-12 00:56:59,917 INFO L78 Accepts]: Start accepts. Automaton has 5578 states and 6396 transitions. Word has length 301 [2022-07-12 00:56:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:56:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 5578 states and 6396 transitions. [2022-07-12 00:56:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-12 00:56:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5578 states and 6396 transitions. [2022-07-12 00:56:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-07-12 00:56:59,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:56:59,928 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 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] [2022-07-12 00:56:59,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 00:56:59,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:56:59,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:56:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash 142462327, now seen corresponding path program 1 times [2022-07-12 00:56:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:56:59,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738437271] [2022-07-12 00:56:59,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:56:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:56:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-07-12 00:57:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738437271] [2022-07-12 00:57:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738437271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:00,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:00,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 00:57:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735945326] [2022-07-12 00:57:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:00,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:00,067 INFO L87 Difference]: Start difference. First operand 5578 states and 6396 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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-12 00:57:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:00,359 INFO L93 Difference]: Finished difference Result 11150 states and 12786 transitions. [2022-07-12 00:57:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:00,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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 379 [2022-07-12 00:57:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:00,378 INFO L225 Difference]: With dead ends: 11150 [2022-07-12 00:57:00,382 INFO L226 Difference]: Without dead ends: 5574 [2022-07-12 00:57:00,388 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-12 00:57:00,389 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:00,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 00:57:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2022-07-12 00:57:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5574. [2022-07-12 00:57:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5574 states, 5573 states have (on average 1.1462408038758298) internal successors, (6388), 5573 states have internal predecessors, (6388), 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-12 00:57:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5574 states to 5574 states and 6388 transitions. [2022-07-12 00:57:00,500 INFO L78 Accepts]: Start accepts. Automaton has 5574 states and 6388 transitions. Word has length 379 [2022-07-12 00:57:00,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:00,500 INFO L495 AbstractCegarLoop]: Abstraction has 5574 states and 6388 transitions. [2022-07-12 00:57:00,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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-12 00:57:00,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 6388 transitions. [2022-07-12 00:57:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2022-07-12 00:57:00,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:00,511 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:57:00,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 00:57:00,512 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash -180803510, now seen corresponding path program 1 times [2022-07-12 00:57:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548013593] [2022-07-12 00:57:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-12 00:57:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:00,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548013593] [2022-07-12 00:57:00,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548013593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:00,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:00,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123445681] [2022-07-12 00:57:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:00,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:00,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:00,671 INFO L87 Difference]: Start difference. First operand 5574 states and 6388 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-12 00:57:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:01,216 INFO L93 Difference]: Finished difference Result 12632 states and 14466 transitions. [2022-07-12 00:57:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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 411 [2022-07-12 00:57:01,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:01,227 INFO L225 Difference]: With dead ends: 12632 [2022-07-12 00:57:01,227 INFO L226 Difference]: Without dead ends: 7060 [2022-07-12 00:57:01,232 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-12 00:57:01,233 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:01,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 179 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7060 states. [2022-07-12 00:57:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7060 to 6862. [2022-07-12 00:57:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6862 states, 6861 states have (on average 1.1380265267453724) internal successors, (7808), 6861 states have internal predecessors, (7808), 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-12 00:57:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6862 states to 6862 states and 7808 transitions. [2022-07-12 00:57:01,303 INFO L78 Accepts]: Start accepts. Automaton has 6862 states and 7808 transitions. Word has length 411 [2022-07-12 00:57:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:01,304 INFO L495 AbstractCegarLoop]: Abstraction has 6862 states and 7808 transitions. [2022-07-12 00:57:01,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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-12 00:57:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6862 states and 7808 transitions. [2022-07-12 00:57:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2022-07-12 00:57:01,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:01,340 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:57:01,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 00:57:01,340 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:01,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:01,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1611250862, now seen corresponding path program 1 times [2022-07-12 00:57:01,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:01,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707921301] [2022-07-12 00:57:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:01,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 00:57:01,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:01,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707921301] [2022-07-12 00:57:01,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707921301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:01,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:01,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:01,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052381992] [2022-07-12 00:57:01,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:01,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:01,475 INFO L87 Difference]: Start difference. First operand 6862 states and 7808 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-12 00:57:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:02,089 INFO L93 Difference]: Finished difference Result 15929 states and 18169 transitions. [2022-07-12 00:57:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:02,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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 463 [2022-07-12 00:57:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:02,100 INFO L225 Difference]: With dead ends: 15929 [2022-07-12 00:57:02,101 INFO L226 Difference]: Without dead ends: 8517 [2022-07-12 00:57:02,107 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-12 00:57:02,107 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 64 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:02,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 351 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:57:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2022-07-12 00:57:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 8333. [2022-07-12 00:57:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8333 states, 8332 states have (on average 1.1331012962073932) internal successors, (9441), 8332 states have internal predecessors, (9441), 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-12 00:57:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8333 states to 8333 states and 9441 transitions. [2022-07-12 00:57:02,190 INFO L78 Accepts]: Start accepts. Automaton has 8333 states and 9441 transitions. Word has length 463 [2022-07-12 00:57:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:02,191 INFO L495 AbstractCegarLoop]: Abstraction has 8333 states and 9441 transitions. [2022-07-12 00:57:02,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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-12 00:57:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 8333 states and 9441 transitions. [2022-07-12 00:57:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2022-07-12 00:57:02,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:02,204 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:57:02,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 00:57:02,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:02,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2033522650, now seen corresponding path program 1 times [2022-07-12 00:57:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:02,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200374961] [2022-07-12 00:57:02,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-07-12 00:57:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:02,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200374961] [2022-07-12 00:57:02,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200374961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:02,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:02,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216769227] [2022-07-12 00:57:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:02,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:02,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:02,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:02,357 INFO L87 Difference]: Start difference. First operand 8333 states and 9441 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-12 00:57:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:02,934 INFO L93 Difference]: Finished difference Result 19072 states and 21665 transitions. [2022-07-12 00:57:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:02,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 499 [2022-07-12 00:57:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:02,948 INFO L225 Difference]: With dead ends: 19072 [2022-07-12 00:57:02,948 INFO L226 Difference]: Without dead ends: 10741 [2022-07-12 00:57:02,955 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-12 00:57:02,955 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:02,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 134 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10741 states. [2022-07-12 00:57:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10741 to 10553. [2022-07-12 00:57:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10553 states, 10552 states have (on average 1.1254738438210765) internal successors, (11876), 10552 states have internal predecessors, (11876), 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-12 00:57:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 11876 transitions. [2022-07-12 00:57:03,091 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 11876 transitions. Word has length 499 [2022-07-12 00:57:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:03,092 INFO L495 AbstractCegarLoop]: Abstraction has 10553 states and 11876 transitions. [2022-07-12 00:57:03,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-12 00:57:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 11876 transitions. [2022-07-12 00:57:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2022-07-12 00:57:03,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:03,113 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-12 00:57:03,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 00:57:03,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1343348106, now seen corresponding path program 1 times [2022-07-12 00:57:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412892408] [2022-07-12 00:57:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-12 00:57:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412892408] [2022-07-12 00:57:03,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412892408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:03,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:03,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092485449] [2022-07-12 00:57:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:03,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:03,231 INFO L87 Difference]: Start difference. First operand 10553 states and 11876 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-12 00:57:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:03,811 INFO L93 Difference]: Finished difference Result 24419 states and 27484 transitions. [2022-07-12 00:57:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:03,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 503 [2022-07-12 00:57:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:03,829 INFO L225 Difference]: With dead ends: 24419 [2022-07-12 00:57:03,829 INFO L226 Difference]: Without dead ends: 13868 [2022-07-12 00:57:03,839 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-12 00:57:03,839 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:03,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 79 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13868 states. [2022-07-12 00:57:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13868 to 13121. [2022-07-12 00:57:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13121 states, 13120 states have (on average 1.118216463414634) internal successors, (14671), 13120 states have internal predecessors, (14671), 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-12 00:57:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13121 states to 13121 states and 14671 transitions. [2022-07-12 00:57:04,051 INFO L78 Accepts]: Start accepts. Automaton has 13121 states and 14671 transitions. Word has length 503 [2022-07-12 00:57:04,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:04,052 INFO L495 AbstractCegarLoop]: Abstraction has 13121 states and 14671 transitions. [2022-07-12 00:57:04,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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-12 00:57:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 13121 states and 14671 transitions. [2022-07-12 00:57:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2022-07-12 00:57:04,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:04,066 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:57:04,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 00:57:04,067 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 101919231, now seen corresponding path program 1 times [2022-07-12 00:57:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:04,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954971459] [2022-07-12 00:57:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 228 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 00:57:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954971459] [2022-07-12 00:57:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954971459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 00:57:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213831183] [2022-07-12 00:57:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:04,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 00:57:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 00:57:04,250 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-12 00:57:04,251 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-12 00:57:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:04,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 00:57:04,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 00:57:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2022-07-12 00:57:04,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 00:57:04,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213831183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:04,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 00:57:04,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-12 00:57:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520125405] [2022-07-12 00:57:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:04,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:04,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:04,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 00:57:04,626 INFO L87 Difference]: Start difference. First operand 13121 states and 14671 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-12 00:57:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:05,184 INFO L93 Difference]: Finished difference Result 15147 states and 16897 transitions. [2022-07-12 00:57:05,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:05,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 509 [2022-07-12 00:57:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:05,203 INFO L225 Difference]: With dead ends: 15147 [2022-07-12 00:57:05,203 INFO L226 Difference]: Without dead ends: 15145 [2022-07-12 00:57:05,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 00:57:05,208 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:05,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 137 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15145 states. [2022-07-12 00:57:05,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15145 to 13121. [2022-07-12 00:57:05,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13121 states, 13120 states have (on average 1.118140243902439) internal successors, (14670), 13120 states have internal predecessors, (14670), 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-12 00:57:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13121 states to 13121 states and 14670 transitions. [2022-07-12 00:57:05,353 INFO L78 Accepts]: Start accepts. Automaton has 13121 states and 14670 transitions. Word has length 509 [2022-07-12 00:57:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:05,354 INFO L495 AbstractCegarLoop]: Abstraction has 13121 states and 14670 transitions. [2022-07-12 00:57:05,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-12 00:57:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 13121 states and 14670 transitions. [2022-07-12 00:57:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2022-07-12 00:57:05,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:05,367 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2022-07-12 00:57:05,387 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-12 00:57:05,583 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,SelfDestructingSolverStorable14 [2022-07-12 00:57:05,584 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -465150684, now seen corresponding path program 1 times [2022-07-12 00:57:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510764173] [2022-07-12 00:57:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 817 backedges. 630 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 00:57:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510764173] [2022-07-12 00:57:05,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510764173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:05,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:05,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:05,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607975232] [2022-07-12 00:57:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:05,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 00:57:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:05,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 00:57:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 00:57:05,751 INFO L87 Difference]: Start difference. First operand 13121 states and 14670 transitions. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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-12 00:57:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:06,808 INFO L93 Difference]: Finished difference Result 34169 states and 37973 transitions. [2022-07-12 00:57:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 00:57:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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 575 [2022-07-12 00:57:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:06,832 INFO L225 Difference]: With dead ends: 34169 [2022-07-12 00:57:06,832 INFO L226 Difference]: Without dead ends: 21050 [2022-07-12 00:57:06,843 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-12 00:57:06,844 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 157 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:06,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 72 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 00:57:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21050 states. [2022-07-12 00:57:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21050 to 19571. [2022-07-12 00:57:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19571 states, 19570 states have (on average 1.1077669902912621) internal successors, (21679), 19570 states have internal predecessors, (21679), 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-12 00:57:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19571 states to 19571 states and 21679 transitions. [2022-07-12 00:57:07,050 INFO L78 Accepts]: Start accepts. Automaton has 19571 states and 21679 transitions. Word has length 575 [2022-07-12 00:57:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:07,050 INFO L495 AbstractCegarLoop]: Abstraction has 19571 states and 21679 transitions. [2022-07-12 00:57:07,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 3 states have internal predecessors, (390), 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-12 00:57:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 19571 states and 21679 transitions. [2022-07-12 00:57:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2022-07-12 00:57:07,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:07,069 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 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-12 00:57:07,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 00:57:07,069 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2090442296, now seen corresponding path program 1 times [2022-07-12 00:57:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:07,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203538318] [2022-07-12 00:57:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2022-07-12 00:57:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:07,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203538318] [2022-07-12 00:57:07,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203538318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:07,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:07,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:07,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124303831] [2022-07-12 00:57:07,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:07,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:07,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:07,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:07,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:07,225 INFO L87 Difference]: Start difference. First operand 19571 states and 21679 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-12 00:57:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:07,896 INFO L93 Difference]: Finished difference Result 39320 states and 43587 transitions. [2022-07-12 00:57:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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 626 [2022-07-12 00:57:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:07,918 INFO L225 Difference]: With dead ends: 39320 [2022-07-12 00:57:07,919 INFO L226 Difference]: Without dead ends: 22331 [2022-07-12 00:57:07,930 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-12 00:57:07,931 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 146 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:07,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 112 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 00:57:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2022-07-12 00:57:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 19939. [2022-07-12 00:57:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19939 states, 19938 states have (on average 1.1019660948941719) internal successors, (21971), 19938 states have internal predecessors, (21971), 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-12 00:57:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19939 states to 19939 states and 21971 transitions. [2022-07-12 00:57:08,157 INFO L78 Accepts]: Start accepts. Automaton has 19939 states and 21971 transitions. Word has length 626 [2022-07-12 00:57:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:08,157 INFO L495 AbstractCegarLoop]: Abstraction has 19939 states and 21971 transitions. [2022-07-12 00:57:08,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-12 00:57:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19939 states and 21971 transitions. [2022-07-12 00:57:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2022-07-12 00:57:08,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:08,174 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 2, 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-12 00:57:08,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 00:57:08,174 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1352424580, now seen corresponding path program 1 times [2022-07-12 00:57:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:08,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268414706] [2022-07-12 00:57:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1217 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2022-07-12 00:57:08,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268414706] [2022-07-12 00:57:08,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268414706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:08,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:08,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:08,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417881771] [2022-07-12 00:57:08,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:08,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:08,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:08,338 INFO L87 Difference]: Start difference. First operand 19939 states and 21971 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-12 00:57:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:08,915 INFO L93 Difference]: Finished difference Result 40795 states and 44946 transitions. [2022-07-12 00:57:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:08,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 659 [2022-07-12 00:57:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:08,936 INFO L225 Difference]: With dead ends: 40795 [2022-07-12 00:57:08,936 INFO L226 Difference]: Without dead ends: 21226 [2022-07-12 00:57:08,949 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-12 00:57:08,950 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 115 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:08,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 137 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2022-07-12 00:57:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 19193. [2022-07-12 00:57:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19193 states, 19192 states have (on average 1.0982180075031263) internal successors, (21077), 19192 states have internal predecessors, (21077), 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-12 00:57:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19193 states to 19193 states and 21077 transitions. [2022-07-12 00:57:09,131 INFO L78 Accepts]: Start accepts. Automaton has 19193 states and 21077 transitions. Word has length 659 [2022-07-12 00:57:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:09,131 INFO L495 AbstractCegarLoop]: Abstraction has 19193 states and 21077 transitions. [2022-07-12 00:57:09,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-12 00:57:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19193 states and 21077 transitions. [2022-07-12 00:57:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2022-07-12 00:57:09,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 00:57:09,147 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-12 00:57:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 00:57:09,147 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 00:57:09,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 00:57:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -58290927, now seen corresponding path program 1 times [2022-07-12 00:57:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 00:57:09,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041074504] [2022-07-12 00:57:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 00:57:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 00:57:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 00:57:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1633 backedges. 1039 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2022-07-12 00:57:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 00:57:09,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041074504] [2022-07-12 00:57:09,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041074504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 00:57:09,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 00:57:09,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 00:57:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291917999] [2022-07-12 00:57:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 00:57:09,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 00:57:09,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 00:57:09,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 00:57:09,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 00:57:09,316 INFO L87 Difference]: Start difference. First operand 19193 states and 21077 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-12 00:57:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 00:57:09,909 INFO L93 Difference]: Finished difference Result 36909 states and 40477 transitions. [2022-07-12 00:57:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 00:57:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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 708 [2022-07-12 00:57:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 00:57:09,910 INFO L225 Difference]: With dead ends: 36909 [2022-07-12 00:57:09,910 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 00:57:09,922 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-12 00:57:09,923 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 00:57:09,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 338 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 00:57:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 00:57:09,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 00:57:09,923 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-12 00:57:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 00:57:09,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2022-07-12 00:57:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 00:57:09,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 00:57:09,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-12 00:57:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 00:57:09,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 00:57:09,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 00:57:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 00:57:09,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 00:57:13,029 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-07-12 00:57:13,029 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,029 INFO L899 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-07-12 00:57:13,029 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-07-12 00:57:13,030 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,031 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L895 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse15 (+ ~a23~0 43))) (let ((.cse14 (<= .cse15 0))) (let ((.cse5 (= ~a25~0 12)) (.cse0 (< 0 (+ (div (+ ~a23~0 (- 139)) 83) 1))) (.cse11 (<= ~a29~0 130)) (.cse9 (= ~a25~0 13)) (.cse7 (<= ~a29~0 274)) (.cse12 (<= ~a29~0 140)) (.cse6 (= ~a4~0 0)) (.cse13 (<= ~a25~0 10)) (.cse4 (<= ~a23~0 312)) (.cse1 (= ~a25~0 11)) (.cse2 (<= ~a8~0 15)) (.cse10 (not .cse14)) (.cse3 (= ~a4~0 1)) (.cse8 (<= 246 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse1 .cse7 .cse2 .cse3 .cse8) (and .cse9 .cse6 .cse2 .cse10 .cse4) (and .cse9 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse11) (and .cse12 .cse6 .cse1 .cse2 .cse4) (and .cse13 .cse2 .cse3) (and .cse6 .cse2 (= ~a25~0 10) .cse11) (and .cse1 .cse2 (<= ~a29~0 220) .cse3 (<= 312 ~a23~0)) (and .cse5 .cse0 .cse2 .cse3) (and .cse14 .cse6 .cse13 .cse2 .cse8) (and .cse14 .cse6 .cse13 .cse2 .cse11) (and .cse9 .cse7 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse8) (and .cse12 .cse6 (< 0 .cse15) .cse13 .cse2 .cse4) (and .cse1 .cse2 .cse10 .cse3 .cse8))))) [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-07-12 00:57:13,034 INFO L902 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,035 INFO L895 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse15 (+ ~a23~0 43))) (let ((.cse14 (<= .cse15 0))) (let ((.cse5 (= ~a25~0 12)) (.cse0 (< 0 (+ (div (+ ~a23~0 (- 139)) 83) 1))) (.cse11 (<= ~a29~0 130)) (.cse9 (= ~a25~0 13)) (.cse7 (<= ~a29~0 274)) (.cse12 (<= ~a29~0 140)) (.cse6 (= ~a4~0 0)) (.cse13 (<= ~a25~0 10)) (.cse4 (<= ~a23~0 312)) (.cse1 (= ~a25~0 11)) (.cse2 (<= ~a8~0 15)) (.cse10 (not .cse14)) (.cse3 (= ~a4~0 1)) (.cse8 (<= 246 ~a29~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse1 .cse7 .cse2 .cse3 .cse8) (and .cse9 .cse6 .cse2 .cse10 .cse4) (and .cse9 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse3 .cse11) (and .cse12 .cse6 .cse1 .cse2 .cse4) (and .cse13 .cse2 .cse3) (and .cse6 .cse2 (= ~a25~0 10) .cse11) (and .cse1 .cse2 (<= ~a29~0 220) .cse3 (<= 312 ~a23~0)) (and .cse5 .cse0 .cse2 .cse3) (and .cse14 .cse6 .cse13 .cse2 .cse8) (and .cse14 .cse6 .cse13 .cse2 .cse11) (and .cse9 .cse7 .cse2 .cse3) (and .cse6 .cse1 .cse2 .cse4 .cse8) (and .cse12 .cse6 (< 0 .cse15) .cse13 .cse2 .cse4) (and .cse1 .cse2 .cse10 .cse3 .cse8))))) [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,036 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,037 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-07-12 00:57:13,038 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,039 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,040 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,041 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-07-12 00:57:13,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-12 00:57:13,043 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-07-12 00:57:13,045 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 00:57:13,047 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 00:57:13,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:57:13 BoogieIcfgContainer [2022-07-12 00:57:13,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 00:57:13,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 00:57:13,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 00:57:13,074 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 00:57:13,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:56:52" (3/4) ... [2022-07-12 00:57:13,077 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 00:57:13,095 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-12 00:57:13,096 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 00:57:13,096 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 00:57:13,097 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 00:57:13,182 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 00:57:13,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 00:57:13,183 INFO L158 Benchmark]: Toolchain (without parser) took 22456.71ms. Allocated memory was 102.8MB in the beginning and 746.6MB in the end (delta: 643.8MB). Free memory was 71.5MB in the beginning and 410.7MB in the end (delta: -339.2MB). Peak memory consumption was 302.8MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,184 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 60.9MB in the beginning and 60.8MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 00:57:13,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.00ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 71.3MB in the beginning and 111.6MB in the end (delta: -40.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.80ms. Allocated memory is still 144.7MB. Free memory was 111.1MB in the beginning and 94.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,185 INFO L158 Benchmark]: Boogie Preprocessor took 86.84ms. Allocated memory is still 144.7MB. Free memory was 94.1MB in the beginning and 85.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,185 INFO L158 Benchmark]: RCFGBuilder took 1305.56ms. Allocated memory is still 144.7MB. Free memory was 85.1MB in the beginning and 98.7MB in the end (delta: -13.7MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,185 INFO L158 Benchmark]: TraceAbstraction took 20276.08ms. Allocated memory was 144.7MB in the beginning and 746.6MB in the end (delta: 601.9MB). Free memory was 98.4MB in the beginning and 426.4MB in the end (delta: -328.0MB). Peak memory consumption was 547.1MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,185 INFO L158 Benchmark]: Witness Printer took 108.49ms. Allocated memory is still 746.6MB. Free memory was 426.4MB in the beginning and 410.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 00:57:13,188 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.17ms. Allocated memory is still 102.8MB. Free memory was 60.9MB in the beginning and 60.8MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.00ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 71.3MB in the beginning and 111.6MB in the end (delta: -40.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.80ms. Allocated memory is still 144.7MB. Free memory was 111.1MB in the beginning and 94.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.84ms. Allocated memory is still 144.7MB. Free memory was 94.1MB in the beginning and 85.1MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1305.56ms. Allocated memory is still 144.7MB. Free memory was 85.1MB in the beginning and 98.7MB in the end (delta: -13.7MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20276.08ms. Allocated memory was 144.7MB in the beginning and 746.6MB in the end (delta: 601.9MB). Free memory was 98.4MB in the beginning and 426.4MB in the end (delta: -328.0MB). Peak memory consumption was 547.1MB. Max. memory is 16.1GB. * Witness Printer took 108.49ms. Allocated memory is still 746.6MB. Free memory was 426.4MB in the beginning and 410.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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: 133]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 19, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2629 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2629 mSDsluCounter, 3790 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 1702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10656 IncrementalHoareTripleChecker+Invalid, 12358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1702 mSolverCounterUnsat, 3394 mSDtfsCounter, 10656 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19939occurred in iteration=17, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 9660 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 207 NumberOfFragments, 559 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1576 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 9306 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 7460 NumberOfCodeBlocks, 7460 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7440 ConstructedInterpolants, 0 QuantifiedInterpolants, 14640 SizeOfPredicates, 1 NumberOfNonLiveVariables, 688 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 10110/10516 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 < (a23 + -139) / 83 + 1 && a25 == 11) && a8 <= 15) && a4 == 1) && a23 <= 312) || ((a25 == 12 && a4 == 0) && a8 <= 15)) || ((((a25 == 11 && a29 <= 274) && a8 <= 15) && a4 == 1) && 246 <= a29)) || ((((a25 == 13 && a4 == 0) && a8 <= 15) && !(a23 + 43 <= 0)) && a23 <= 312)) || (((a25 == 13 && 0 < (a23 + -139) / 83 + 1) && a8 <= 15) && a4 == 1)) || (((a25 == 12 && a8 <= 15) && a4 == 1) && a29 <= 130)) || ((((a29 <= 140 && a4 == 0) && a25 == 11) && a8 <= 15) && a23 <= 312)) || ((a25 <= 10 && a8 <= 15) && a4 == 1)) || (((a4 == 0 && a8 <= 15) && a25 == 10) && a29 <= 130)) || ((((a25 == 11 && a8 <= 15) && a29 <= 220) && a4 == 1) && 312 <= a23)) || (((a25 == 12 && 0 < (a23 + -139) / 83 + 1) && a8 <= 15) && a4 == 1)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a8 <= 15) && 246 <= a29)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a8 <= 15) && a29 <= 130)) || (((a25 == 13 && a29 <= 274) && a8 <= 15) && a4 == 1)) || ((((a4 == 0 && a25 == 11) && a8 <= 15) && a23 <= 312) && 246 <= a29)) || (((((a29 <= 140 && a4 == 0) && 0 < a23 + 43) && a25 <= 10) && a8 <= 15) && a23 <= 312)) || ((((a25 == 11 && a8 <= 15) && !(a23 + 43 <= 0)) && a4 == 1) && 246 <= a29) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 < (a23 + -139) / 83 + 1 && a25 == 11) && a8 <= 15) && a4 == 1) && a23 <= 312) || ((a25 == 12 && a4 == 0) && a8 <= 15)) || ((((a25 == 11 && a29 <= 274) && a8 <= 15) && a4 == 1) && 246 <= a29)) || ((((a25 == 13 && a4 == 0) && a8 <= 15) && !(a23 + 43 <= 0)) && a23 <= 312)) || (((a25 == 13 && 0 < (a23 + -139) / 83 + 1) && a8 <= 15) && a4 == 1)) || (((a25 == 12 && a8 <= 15) && a4 == 1) && a29 <= 130)) || ((((a29 <= 140 && a4 == 0) && a25 == 11) && a8 <= 15) && a23 <= 312)) || ((a25 <= 10 && a8 <= 15) && a4 == 1)) || (((a4 == 0 && a8 <= 15) && a25 == 10) && a29 <= 130)) || ((((a25 == 11 && a8 <= 15) && a29 <= 220) && a4 == 1) && 312 <= a23)) || (((a25 == 12 && 0 < (a23 + -139) / 83 + 1) && a8 <= 15) && a4 == 1)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a8 <= 15) && 246 <= a29)) || ((((a23 + 43 <= 0 && a4 == 0) && a25 <= 10) && a8 <= 15) && a29 <= 130)) || (((a25 == 13 && a29 <= 274) && a8 <= 15) && a4 == 1)) || ((((a4 == 0 && a25 == 11) && a8 <= 15) && a23 <= 312) && 246 <= a29)) || (((((a29 <= 140 && a4 == 0) && 0 < a23 + 43) && a25 <= 10) && a8 <= 15) && a23 <= 312)) || ((((a25 == 11 && a8 <= 15) && !(a23 + 43 <= 0)) && a4 == 1) && 246 <= a29) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 00:57:13,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE