./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label11.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/Problem15_label11.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 b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 01:17:50,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 01:17:50,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 01:17:50,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 01:17:50,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 01:17:50,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 01:17:50,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 01:17:50,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 01:17:50,942 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 01:17:50,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 01:17:50,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 01:17:50,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 01:17:50,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 01:17:50,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 01:17:50,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 01:17:50,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 01:17:50,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 01:17:50,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 01:17:50,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 01:17:50,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 01:17:50,967 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 01:17:50,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 01:17:50,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 01:17:50,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 01:17:50,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 01:17:50,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 01:17:50,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 01:17:50,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 01:17:50,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 01:17:50,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 01:17:50,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 01:17:50,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 01:17:50,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 01:17:50,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 01:17:50,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 01:17:50,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 01:17:50,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 01:17:50,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 01:17:50,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 01:17:50,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 01:17:50,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 01:17:50,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 01:17:50,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 01:17:51,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 01:17:51,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 01:17:51,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 01:17:51,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 01:17:51,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 01:17:51,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 01:17:51,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 01:17:51,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 01:17:51,014 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 01:17:51,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 01:17:51,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 01:17:51,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 01:17:51,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 01:17:51,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 01:17:51,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 01:17:51,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 01:17:51,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 01:17:51,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 01:17:51,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 01:17:51,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 01:17:51,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 01:17:51,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 01:17:51,018 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 01:17:51,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 01:17:51,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:17:51,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 01:17:51,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 01:17:51,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 01:17:51,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 01:17:51,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 01:17:51,020 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 01:17:51,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 01:17:51,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 01:17:51,021 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 -> b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b [2022-07-12 01:17:51,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 01:17:51,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 01:17:51,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 01:17:51,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 01:17:51,310 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 01:17:51,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-07-12 01:17:51,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60c4bc0e/4a9c4cc9966d479a90984deb848ed759/FLAGa60252259 [2022-07-12 01:17:51,969 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 01:17:51,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-07-12 01:17:51,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60c4bc0e/4a9c4cc9966d479a90984deb848ed759/FLAGa60252259 [2022-07-12 01:17:52,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60c4bc0e/4a9c4cc9966d479a90984deb848ed759 [2022-07-12 01:17:52,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 01:17:52,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 01:17:52,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 01:17:52,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 01:17:52,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 01:17:52,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:17:52" (1/1) ... [2022-07-12 01:17:52,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64011c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:52, skipping insertion in model container [2022-07-12 01:17:52,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:17:52" (1/1) ... [2022-07-12 01:17:52,350 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 01:17:52,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 01:17:52,598 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/Problem15_label11.c[6732,6745] [2022-07-12 01:17:52,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:17:52,983 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 01:17:53,005 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/Problem15_label11.c[6732,6745] [2022-07-12 01:17:53,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 01:17:53,174 INFO L208 MainTranslator]: Completed translation [2022-07-12 01:17:53,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53 WrapperNode [2022-07-12 01:17:53,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 01:17:53,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 01:17:53,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 01:17:53,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 01:17:53,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,362 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-07-12 01:17:53,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 01:17:53,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 01:17:53,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 01:17:53,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 01:17:53,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 01:17:53,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 01:17:53,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 01:17:53,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 01:17:53,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (1/1) ... [2022-07-12 01:17:53,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 01:17:53,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:17:53,620 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 01:17:53,631 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 01:17:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 01:17:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 01:17:53,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 01:17:53,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 01:17:53,707 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 01:17:53,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 01:17:56,185 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 01:17:56,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 01:17:56,195 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 01:17:56,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:17:56 BoogieIcfgContainer [2022-07-12 01:17:56,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 01:17:56,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 01:17:56,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 01:17:56,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 01:17:56,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:17:52" (1/3) ... [2022-07-12 01:17:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:17:56, skipping insertion in model container [2022-07-12 01:17:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:17:53" (2/3) ... [2022-07-12 01:17:56,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e9fb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:17:56, skipping insertion in model container [2022-07-12 01:17:56,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:17:56" (3/3) ... [2022-07-12 01:17:56,204 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2022-07-12 01:17:56,216 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 01:17:56,216 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 01:17:56,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 01:17:56,267 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@6466a89f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7599c69b [2022-07-12 01:17:56,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 01:17:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 01:17:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 01:17:56,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:17:56,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:17:56,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:17:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:17:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2022-07-12 01:17:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:17:56,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795939060] [2022-07-12 01:17:56,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:17:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:17:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:17:56,565 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 01:17:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:17:56,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795939060] [2022-07-12 01:17:56,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795939060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:17:56,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:17:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:17:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156950060] [2022-07-12 01:17:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:17:56,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:17:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:17:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:17:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:17:56,610 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 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 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 01:17:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:17:58,858 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions. [2022-07-12 01:17:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:17:58,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 55 [2022-07-12 01:17:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:17:58,875 INFO L225 Difference]: With dead ends: 1197 [2022-07-12 01:17:58,875 INFO L226 Difference]: Without dead ends: 694 [2022-07-12 01:17:58,879 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 01:17:58,882 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 363 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 01:17:58,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 01:17:58,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-12 01:17:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2022-07-12 01:17:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 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 01:17:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2022-07-12 01:17:58,945 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 55 [2022-07-12 01:17:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:17:58,946 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2022-07-12 01:17:58,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 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 01:17:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2022-07-12 01:17:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 01:17:58,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:17:58,950 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, 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] [2022-07-12 01:17:58,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 01:17:58,951 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:17:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:17:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1666804951, now seen corresponding path program 1 times [2022-07-12 01:17:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:17:58,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287900750] [2022-07-12 01:17:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:17:58,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:17:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:17:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:17:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:17:59,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287900750] [2022-07-12 01:17:59,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287900750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:17:59,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:17:59,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:17:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933577664] [2022-07-12 01:17:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:17:59,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:17:59,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:17:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:17:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:17:59,109 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 01:18:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:00,711 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2022-07-12 01:18:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 120 [2022-07-12 01:18:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:00,717 INFO L225 Difference]: With dead ends: 1681 [2022-07-12 01:18:00,717 INFO L226 Difference]: Without dead ends: 999 [2022-07-12 01:18:00,723 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 01:18:00,724 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:00,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 01:18:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-12 01:18:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2022-07-12 01:18:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 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 01:18:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2022-07-12 01:18:00,749 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 120 [2022-07-12 01:18:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:00,750 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2022-07-12 01:18:00,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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 01:18:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2022-07-12 01:18:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 01:18:00,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:00,754 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, 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] [2022-07-12 01:18:00,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 01:18:00,755 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2119716484, now seen corresponding path program 1 times [2022-07-12 01:18:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643378489] [2022-07-12 01:18:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:18:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:00,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643378489] [2022-07-12 01:18:00,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643378489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:00,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:00,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:18:00,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469509595] [2022-07-12 01:18:00,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:00,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:00,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:00,835 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 01:18:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:02,174 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions. [2022-07-12 01:18:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-07-12 01:18:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:02,180 INFO L225 Difference]: With dead ends: 2575 [2022-07-12 01:18:02,180 INFO L226 Difference]: Without dead ends: 1588 [2022-07-12 01:18:02,182 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 01:18:02,183 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:02,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 01:18:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-07-12 01:18:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2022-07-12 01:18:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.3986102337334176) internal successors, (2214), 1583 states have internal predecessors, (2214), 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 01:18:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions. [2022-07-12 01:18:02,212 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 121 [2022-07-12 01:18:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:02,213 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions. [2022-07-12 01:18:02,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 01:18:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions. [2022-07-12 01:18:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 01:18:02,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:02,217 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, 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 01:18:02,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 01:18:02,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:02,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1178280902, now seen corresponding path program 1 times [2022-07-12 01:18:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:02,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212200480] [2022-07-12 01:18:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:18:02,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:02,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212200480] [2022-07-12 01:18:02,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212200480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:02,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:02,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:18:02,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596944462] [2022-07-12 01:18:02,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:02,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:18:02,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:02,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:18:02,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:02,377 INFO L87 Difference]: Start difference. First operand 1584 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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 01:18:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:04,393 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions. [2022-07-12 01:18:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:18:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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 125 [2022-07-12 01:18:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:04,404 INFO L225 Difference]: With dead ends: 4090 [2022-07-12 01:18:04,404 INFO L226 Difference]: Without dead ends: 2807 [2022-07-12 01:18:04,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:04,411 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 349 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:04,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 416 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 01:18:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-12 01:18:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184. [2022-07-12 01:18:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.3302794319743472) internal successors, (2904), 2183 states have internal predecessors, (2904), 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 01:18:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions. [2022-07-12 01:18:04,454 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 125 [2022-07-12 01:18:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:04,455 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions. [2022-07-12 01:18:04,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 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 01:18:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions. [2022-07-12 01:18:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-12 01:18:04,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:04,465 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:04,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 01:18:04,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2088752626, now seen corresponding path program 1 times [2022-07-12 01:18:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:04,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648856334] [2022-07-12 01:18:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 01:18:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648856334] [2022-07-12 01:18:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648856334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:04,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:18:04,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225023526] [2022-07-12 01:18:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:04,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:04,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:04,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:04,692 INFO L87 Difference]: Start difference. First operand 2184 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 01:18:06,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:06,427 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions. [2022-07-12 01:18:06,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:06,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 325 [2022-07-12 01:18:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:06,441 INFO L225 Difference]: With dead ends: 5868 [2022-07-12 01:18:06,441 INFO L226 Difference]: Without dead ends: 3686 [2022-07-12 01:18:06,445 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 01:18:06,446 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:06,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:18:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-07-12 01:18:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2022-07-12 01:18:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3683 states have (on average 1.25821341297855) internal successors, (4634), 3683 states have internal predecessors, (4634), 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 01:18:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2022-07-12 01:18:06,509 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 325 [2022-07-12 01:18:06,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:06,512 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2022-07-12 01:18:06,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 01:18:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2022-07-12 01:18:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-07-12 01:18:06,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:06,521 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, 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, 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] [2022-07-12 01:18:06,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 01:18:06,522 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:06,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1998947477, now seen corresponding path program 1 times [2022-07-12 01:18:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:06,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674118492] [2022-07-12 01:18:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 01:18:06,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674118492] [2022-07-12 01:18:06,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674118492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:06,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:06,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 01:18:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356235714] [2022-07-12 01:18:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:06,728 INFO L87 Difference]: Start difference. First operand 3684 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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 01:18:07,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:07,877 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2022-07-12 01:18:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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 373 [2022-07-12 01:18:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:07,892 INFO L225 Difference]: With dead ends: 7665 [2022-07-12 01:18:07,892 INFO L226 Difference]: Without dead ends: 3983 [2022-07-12 01:18:07,897 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 01:18:07,898 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:07,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 01:18:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2022-07-12 01:18:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2022-07-12 01:18:07,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3982 states have (on average 1.2403314917127073) internal successors, (4939), 3982 states have internal predecessors, (4939), 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 01:18:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2022-07-12 01:18:07,964 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 373 [2022-07-12 01:18:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:07,965 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2022-07-12 01:18:07,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 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 01:18:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2022-07-12 01:18:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-07-12 01:18:07,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:07,972 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:07,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 01:18:07,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:07,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1174077085, now seen corresponding path program 1 times [2022-07-12 01:18:07,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:07,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184357244] [2022-07-12 01:18:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 01:18:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:08,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184357244] [2022-07-12 01:18:08,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184357244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:08,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:08,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407025622] [2022-07-12 01:18:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:08,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:08,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:08,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:08,204 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 01:18:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:09,862 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2022-07-12 01:18:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 416 [2022-07-12 01:18:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:09,881 INFO L225 Difference]: With dead ends: 8861 [2022-07-12 01:18:09,881 INFO L226 Difference]: Without dead ends: 5179 [2022-07-12 01:18:09,885 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 01:18:09,886 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 259 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:09,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 01:18:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2022-07-12 01:18:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2022-07-12 01:18:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.26301775147929) internal successors, (4269), 3380 states have internal predecessors, (4269), 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 01:18:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2022-07-12 01:18:09,946 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 416 [2022-07-12 01:18:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:09,947 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2022-07-12 01:18:09,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 01:18:09,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2022-07-12 01:18:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-07-12 01:18:09,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:09,954 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:09,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 01:18:09,954 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:09,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1674238342, now seen corresponding path program 1 times [2022-07-12 01:18:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:09,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526789803] [2022-07-12 01:18:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 01:18:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:10,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526789803] [2022-07-12 01:18:10,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526789803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:10,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:10,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 01:18:10,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164626095] [2022-07-12 01:18:10,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:10,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:18:10,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:10,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:18:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:10,263 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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 01:18:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:12,078 INFO L93 Difference]: Finished difference Result 8297 states and 10744 transitions. [2022-07-12 01:18:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 01:18:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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 420 [2022-07-12 01:18:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:12,093 INFO L225 Difference]: With dead ends: 8297 [2022-07-12 01:18:12,093 INFO L226 Difference]: Without dead ends: 5217 [2022-07-12 01:18:12,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:12,098 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 387 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:12,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 379 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:18:12,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-07-12 01:18:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4878. [2022-07-12 01:18:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4877 states have (on average 1.2259585810949354) internal successors, (5979), 4877 states have internal predecessors, (5979), 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 01:18:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 5979 transitions. [2022-07-12 01:18:12,216 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 5979 transitions. Word has length 420 [2022-07-12 01:18:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:12,217 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 5979 transitions. [2022-07-12 01:18:12,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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 01:18:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 5979 transitions. [2022-07-12 01:18:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-07-12 01:18:12,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:12,225 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:12,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 01:18:12,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 381390040, now seen corresponding path program 1 times [2022-07-12 01:18:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:12,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593002670] [2022-07-12 01:18:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:12,429 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 01:18:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593002670] [2022-07-12 01:18:12,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593002670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:12,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:12,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831039748] [2022-07-12 01:18:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:12,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:12,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:12,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:12,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:12,433 INFO L87 Difference]: Start difference. First operand 4878 states and 5979 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 01:18:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:13,848 INFO L93 Difference]: Finished difference Result 10952 states and 13771 transitions. [2022-07-12 01:18:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2022-07-12 01:18:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:13,868 INFO L225 Difference]: With dead ends: 10952 [2022-07-12 01:18:13,868 INFO L226 Difference]: Without dead ends: 6375 [2022-07-12 01:18:13,873 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 01:18:13,874 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:13,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 619 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:18:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2022-07-12 01:18:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6374. [2022-07-12 01:18:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6374 states, 6373 states have (on average 1.198022909147968) internal successors, (7635), 6373 states have internal predecessors, (7635), 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 01:18:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7635 transitions. [2022-07-12 01:18:13,983 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7635 transitions. Word has length 432 [2022-07-12 01:18:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:13,984 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7635 transitions. [2022-07-12 01:18:13,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 01:18:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7635 transitions. [2022-07-12 01:18:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2022-07-12 01:18:13,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:13,995 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:13,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 01:18:13,996 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1616945835, now seen corresponding path program 1 times [2022-07-12 01:18:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:13,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794853192] [2022-07-12 01:18:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-12 01:18:14,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794853192] [2022-07-12 01:18:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794853192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:14,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719160631] [2022-07-12 01:18:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:14,252 INFO L87 Difference]: Start difference. First operand 6374 states and 7635 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 01:18:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:15,980 INFO L93 Difference]: Finished difference Result 16633 states and 20159 transitions. [2022-07-12 01:18:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 529 [2022-07-12 01:18:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:16,010 INFO L225 Difference]: With dead ends: 16633 [2022-07-12 01:18:16,010 INFO L226 Difference]: Without dead ends: 10560 [2022-07-12 01:18:16,015 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 01:18:16,016 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 285 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:16,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 263 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:18:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-12 01:18:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467. [2022-07-12 01:18:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8467 states, 8466 states have (on average 1.1961965509095205) internal successors, (10127), 8466 states have internal predecessors, (10127), 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 01:18:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10127 transitions. [2022-07-12 01:18:16,127 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10127 transitions. Word has length 529 [2022-07-12 01:18:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:16,128 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 10127 transitions. [2022-07-12 01:18:16,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 01:18:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10127 transitions. [2022-07-12 01:18:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-07-12 01:18:16,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:16,136 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 01:18:16,136 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1652572232, now seen corresponding path program 1 times [2022-07-12 01:18:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:16,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965461478] [2022-07-12 01:18:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-12 01:18:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:16,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965461478] [2022-07-12 01:18:16,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965461478] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:16,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:16,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015705942] [2022-07-12 01:18:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:16,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:16,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:16,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:16,360 INFO L87 Difference]: Start difference. First operand 8467 states and 10127 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 01:18:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:18,112 INFO L93 Difference]: Finished difference Result 19937 states and 23976 transitions. [2022-07-12 01:18:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:18,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 546 [2022-07-12 01:18:18,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:18,130 INFO L225 Difference]: With dead ends: 19937 [2022-07-12 01:18:18,130 INFO L226 Difference]: Without dead ends: 11771 [2022-07-12 01:18:18,138 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 01:18:18,139 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 243 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:18,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 621 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 01:18:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2022-07-12 01:18:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11759. [2022-07-12 01:18:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11759 states, 11758 states have (on average 1.173924136757952) internal successors, (13803), 11758 states have internal predecessors, (13803), 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 01:18:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 13803 transitions. [2022-07-12 01:18:18,282 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 13803 transitions. Word has length 546 [2022-07-12 01:18:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:18,283 INFO L495 AbstractCegarLoop]: Abstraction has 11759 states and 13803 transitions. [2022-07-12 01:18:18,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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 01:18:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 13803 transitions. [2022-07-12 01:18:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-12 01:18:18,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:18,290 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:18,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 01:18:18,290 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash -889884113, now seen corresponding path program 1 times [2022-07-12 01:18:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:18,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542582457] [2022-07-12 01:18:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-12 01:18:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:18,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542582457] [2022-07-12 01:18:18,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542582457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:18,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:18,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672547828] [2022-07-12 01:18:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:18,541 INFO L87 Difference]: Start difference. First operand 11759 states and 13803 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 01:18:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:20,034 INFO L93 Difference]: Finished difference Result 23514 states and 27644 transitions. [2022-07-12 01:18:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:20,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 556 [2022-07-12 01:18:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:20,053 INFO L225 Difference]: With dead ends: 23514 [2022-07-12 01:18:20,053 INFO L226 Difference]: Without dead ends: 12056 [2022-07-12 01:18:20,065 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 01:18:20,066 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:20,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:18:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2022-07-12 01:18:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11757. [2022-07-12 01:18:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11756 states have (on average 1.1737835998638992) internal successors, (13799), 11756 states have internal predecessors, (13799), 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 01:18:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13799 transitions. [2022-07-12 01:18:20,208 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13799 transitions. Word has length 556 [2022-07-12 01:18:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:20,208 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 13799 transitions. [2022-07-12 01:18:20,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 01:18:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13799 transitions. [2022-07-12 01:18:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-12 01:18:20,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:20,217 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 01:18:20,217 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:20,218 INFO L85 PathProgramCache]: Analyzing trace with hash 967458274, now seen corresponding path program 1 times [2022-07-12 01:18:20,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:20,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625914549] [2022-07-12 01:18:20,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-12 01:18:20,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625914549] [2022-07-12 01:18:20,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625914549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:20,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:20,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812815506] [2022-07-12 01:18:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:20,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:20,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:20,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:20,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:20,452 INFO L87 Difference]: Start difference. First operand 11757 states and 13799 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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 01:18:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:21,548 INFO L93 Difference]: Finished difference Result 24708 states and 28972 transitions. [2022-07-12 01:18:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:21,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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 576 [2022-07-12 01:18:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:21,569 INFO L225 Difference]: With dead ends: 24708 [2022-07-12 01:18:21,569 INFO L226 Difference]: Without dead ends: 13252 [2022-07-12 01:18:21,581 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 01:18:21,581 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 270 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:21,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 324 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 01:18:21,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2022-07-12 01:18:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 9960. [2022-07-12 01:18:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9960 states, 9959 states have (on average 1.1905813836730594) internal successors, (11857), 9959 states have internal predecessors, (11857), 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 01:18:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 11857 transitions. [2022-07-12 01:18:21,702 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 11857 transitions. Word has length 576 [2022-07-12 01:18:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:21,702 INFO L495 AbstractCegarLoop]: Abstraction has 9960 states and 11857 transitions. [2022-07-12 01:18:21,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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 01:18:21,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 11857 transitions. [2022-07-12 01:18:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2022-07-12 01:18:21,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:21,711 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, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:21,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 01:18:21,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:21,713 INFO L85 PathProgramCache]: Analyzing trace with hash -270881818, now seen corresponding path program 1 times [2022-07-12 01:18:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:21,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997552367] [2022-07-12 01:18:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:21,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 01:18:21,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:21,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997552367] [2022-07-12 01:18:21,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997552367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:21,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:21,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911353185] [2022-07-12 01:18:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:21,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:21,982 INFO L87 Difference]: Start difference. First operand 9960 states and 11857 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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 01:18:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:23,540 INFO L93 Difference]: Finished difference Result 25898 states and 30912 transitions. [2022-07-12 01:18:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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 582 [2022-07-12 01:18:23,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:23,559 INFO L225 Difference]: With dead ends: 25898 [2022-07-12 01:18:23,559 INFO L226 Difference]: Without dead ends: 16239 [2022-07-12 01:18:23,570 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 01:18:23,571 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 223 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:23,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 189 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:18:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16239 states. [2022-07-12 01:18:23,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16239 to 12053. [2022-07-12 01:18:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12053 states, 12052 states have (on average 1.211749087288417) internal successors, (14604), 12052 states have internal predecessors, (14604), 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 01:18:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12053 states to 12053 states and 14604 transitions. [2022-07-12 01:18:23,771 INFO L78 Accepts]: Start accepts. Automaton has 12053 states and 14604 transitions. Word has length 582 [2022-07-12 01:18:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:23,771 INFO L495 AbstractCegarLoop]: Abstraction has 12053 states and 14604 transitions. [2022-07-12 01:18:23,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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 01:18:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12053 states and 14604 transitions. [2022-07-12 01:18:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2022-07-12 01:18:23,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:23,781 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, 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, 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, 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, 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] [2022-07-12 01:18:23,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 01:18:23,781 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -830480631, now seen corresponding path program 1 times [2022-07-12 01:18:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731857762] [2022-07-12 01:18:23,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 599 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-12 01:18:24,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:24,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731857762] [2022-07-12 01:18:24,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731857762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:24,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518560597] [2022-07-12 01:18:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:24,019 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 01:18:24,040 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 01:18:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:24,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:18:24,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 01:18:24,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:18:24,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518560597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:24,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:18:24,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:18:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870759357] [2022-07-12 01:18:24,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:24,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:24,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:24,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:24,378 INFO L87 Difference]: Start difference. First operand 12053 states and 14604 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 01:18:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:26,082 INFO L93 Difference]: Finished difference Result 27095 states and 33543 transitions. [2022-07-12 01:18:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:26,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 619 [2022-07-12 01:18:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:26,097 INFO L225 Difference]: With dead ends: 27095 [2022-07-12 01:18:26,097 INFO L226 Difference]: Without dead ends: 15343 [2022-07-12 01:18:26,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:26,106 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 266 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:26,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 01:18:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2022-07-12 01:18:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14446. [2022-07-12 01:18:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14446 states, 14445 states have (on average 1.1910695742471444) internal successors, (17205), 14445 states have internal predecessors, (17205), 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 01:18:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14446 states to 14446 states and 17205 transitions. [2022-07-12 01:18:26,275 INFO L78 Accepts]: Start accepts. Automaton has 14446 states and 17205 transitions. Word has length 619 [2022-07-12 01:18:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:26,276 INFO L495 AbstractCegarLoop]: Abstraction has 14446 states and 17205 transitions. [2022-07-12 01:18:26,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 01:18:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14446 states and 17205 transitions. [2022-07-12 01:18:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-07-12 01:18:26,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:26,291 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2022-07-12 01:18:26,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 01:18:26,507 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 01:18:26,508 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:26,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1205457609, now seen corresponding path program 1 times [2022-07-12 01:18:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:26,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748718224] [2022-07-12 01:18:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-12 01:18:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:26,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748718224] [2022-07-12 01:18:26,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748718224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:26,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220596024] [2022-07-12 01:18:26,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:26,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:18:26,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 01:18:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:27,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 01:18:27,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-12 01:18:27,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:18:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-12 01:18:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220596024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:18:28,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:18:28,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-12 01:18:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227057635] [2022-07-12 01:18:28,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:18:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 01:18:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 01:18:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:18:28,299 INFO L87 Difference]: Start difference. First operand 14446 states and 17205 transitions. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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 01:18:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:33,459 INFO L93 Difference]: Finished difference Result 36223 states and 42637 transitions. [2022-07-12 01:18:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 01:18:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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 676 [2022-07-12 01:18:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:33,527 INFO L225 Difference]: With dead ends: 36223 [2022-07-12 01:18:33,527 INFO L226 Difference]: Without dead ends: 16839 [2022-07-12 01:18:33,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1361 GetRequests, 1346 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-07-12 01:18:33,536 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 2855 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5804 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 5804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:33,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 236 Invalid, 6474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 5804 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 01:18:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2022-07-12 01:18:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 16836. [2022-07-12 01:18:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16836 states, 16835 states have (on average 1.0657558657558657) internal successors, (17942), 16835 states have internal predecessors, (17942), 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 01:18:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16836 states to 16836 states and 17942 transitions. [2022-07-12 01:18:33,707 INFO L78 Accepts]: Start accepts. Automaton has 16836 states and 17942 transitions. Word has length 676 [2022-07-12 01:18:33,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:33,708 INFO L495 AbstractCegarLoop]: Abstraction has 16836 states and 17942 transitions. [2022-07-12 01:18:33,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 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 01:18:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16836 states and 17942 transitions. [2022-07-12 01:18:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2022-07-12 01:18:33,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:33,720 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, 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, 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, 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, 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] [2022-07-12 01:18:33,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 01:18:33,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 01:18:33,925 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash 547646301, now seen corresponding path program 1 times [2022-07-12 01:18:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:33,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570690761] [2022-07-12 01:18:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:34,175 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-07-12 01:18:34,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:34,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570690761] [2022-07-12 01:18:34,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570690761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:34,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:34,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957961465] [2022-07-12 01:18:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:34,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:34,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:34,179 INFO L87 Difference]: Start difference. First operand 16836 states and 17942 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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 01:18:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:35,075 INFO L93 Difference]: Finished difference Result 35761 states and 38184 transitions. [2022-07-12 01:18:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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 684 [2022-07-12 01:18:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:35,092 INFO L225 Difference]: With dead ends: 35761 [2022-07-12 01:18:35,092 INFO L226 Difference]: Without dead ends: 19226 [2022-07-12 01:18:35,103 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 01:18:35,104 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:35,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 505 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 01:18:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19226 states. [2022-07-12 01:18:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19226 to 18927. [2022-07-12 01:18:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18927 states, 18926 states have (on average 1.054845186515904) internal successors, (19964), 18926 states have internal predecessors, (19964), 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 01:18:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18927 states to 18927 states and 19964 transitions. [2022-07-12 01:18:35,319 INFO L78 Accepts]: Start accepts. Automaton has 18927 states and 19964 transitions. Word has length 684 [2022-07-12 01:18:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:35,319 INFO L495 AbstractCegarLoop]: Abstraction has 18927 states and 19964 transitions. [2022-07-12 01:18:35,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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 01:18:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18927 states and 19964 transitions. [2022-07-12 01:18:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2022-07-12 01:18:35,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:35,330 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, 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, 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, 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, 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, 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, 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 01:18:35,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 01:18:35,331 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1636456743, now seen corresponding path program 1 times [2022-07-12 01:18:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550783096] [2022-07-12 01:18:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 292 proven. 269 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 01:18:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:35,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550783096] [2022-07-12 01:18:35,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550783096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:35,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043450967] [2022-07-12 01:18:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:35,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:18:35,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 01:18:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:35,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:18:35,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 01:18:36,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:18:36,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043450967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:36,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:18:36,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:18:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177332308] [2022-07-12 01:18:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:36,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:36,178 INFO L87 Difference]: Start difference. First operand 18927 states and 19964 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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 01:18:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:37,003 INFO L93 Difference]: Finished difference Result 37555 states and 39628 transitions. [2022-07-12 01:18:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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 694 [2022-07-12 01:18:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:37,026 INFO L225 Difference]: With dead ends: 37555 [2022-07-12 01:18:37,027 INFO L226 Difference]: Without dead ends: 18929 [2022-07-12 01:18:37,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:37,042 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 104 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:37,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 395 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 01:18:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2022-07-12 01:18:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18626. [2022-07-12 01:18:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18626 states, 18625 states have (on average 1.0488053691275168) internal successors, (19534), 18625 states have internal predecessors, (19534), 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 01:18:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18626 states to 18626 states and 19534 transitions. [2022-07-12 01:18:37,214 INFO L78 Accepts]: Start accepts. Automaton has 18626 states and 19534 transitions. Word has length 694 [2022-07-12 01:18:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:37,214 INFO L495 AbstractCegarLoop]: Abstraction has 18626 states and 19534 transitions. [2022-07-12 01:18:37,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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 01:18:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18626 states and 19534 transitions. [2022-07-12 01:18:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2022-07-12 01:18:37,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:37,225 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, 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, 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, 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, 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] [2022-07-12 01:18:37,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 01:18:37,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 01:18:37,447 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash 696512821, now seen corresponding path program 1 times [2022-07-12 01:18:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:37,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970834713] [2022-07-12 01:18:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 01:18:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970834713] [2022-07-12 01:18:37,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970834713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:37,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:37,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:18:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320674376] [2022-07-12 01:18:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:18:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:18:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:18:37,763 INFO L87 Difference]: Start difference. First operand 18626 states and 19534 transitions. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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 01:18:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:39,012 INFO L93 Difference]: Finished difference Result 42657 states and 44659 transitions. [2022-07-12 01:18:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:18:39,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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 732 [2022-07-12 01:18:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:39,035 INFO L225 Difference]: With dead ends: 42657 [2022-07-12 01:18:39,035 INFO L226 Difference]: Without dead ends: 24332 [2022-07-12 01:18:39,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:18:39,048 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 368 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:39,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 498 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 01:18:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2022-07-12 01:18:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 22533. [2022-07-12 01:18:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.0431386472572342) internal successors, (23504), 22532 states have internal predecessors, (23504), 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 01:18:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 23504 transitions. [2022-07-12 01:18:39,260 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 23504 transitions. Word has length 732 [2022-07-12 01:18:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:39,261 INFO L495 AbstractCegarLoop]: Abstraction has 22533 states and 23504 transitions. [2022-07-12 01:18:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 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 01:18:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 23504 transitions. [2022-07-12 01:18:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-07-12 01:18:39,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:39,269 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, 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, 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, 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] [2022-07-12 01:18:39,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 01:18:39,269 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:39,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1684182335, now seen corresponding path program 1 times [2022-07-12 01:18:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:39,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581345195] [2022-07-12 01:18:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:39,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 563 proven. 188 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-12 01:18:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:39,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581345195] [2022-07-12 01:18:39,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581345195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:39,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482917801] [2022-07-12 01:18:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:39,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:39,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:39,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:18:39,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 01:18:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:39,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 01:18:39,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2022-07-12 01:18:40,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:18:40,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482917801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:40,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:18:40,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 01:18:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109564261] [2022-07-12 01:18:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:40,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:40,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:40,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:40,877 INFO L87 Difference]: Start difference. First operand 22533 states and 23504 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 01:18:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:40,991 INFO L93 Difference]: Finished difference Result 23437 states and 24418 transitions. [2022-07-12 01:18:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 746 [2022-07-12 01:18:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:41,015 INFO L225 Difference]: With dead ends: 23437 [2022-07-12 01:18:41,015 INFO L226 Difference]: Without dead ends: 23435 [2022-07-12 01:18:41,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 01:18:41,024 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 785 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:41,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 523 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 785 Unchecked, 0.0s Time] [2022-07-12 01:18:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2022-07-12 01:18:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 22234. [2022-07-12 01:18:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22234 states, 22233 states have (on average 1.042819232672154) internal successors, (23185), 22233 states have internal predecessors, (23185), 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 01:18:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 23185 transitions. [2022-07-12 01:18:41,264 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 23185 transitions. Word has length 746 [2022-07-12 01:18:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:41,264 INFO L495 AbstractCegarLoop]: Abstraction has 22234 states and 23185 transitions. [2022-07-12 01:18:41,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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 01:18:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 23185 transitions. [2022-07-12 01:18:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2022-07-12 01:18:41,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:41,278 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:41,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 01:18:41,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:41,479 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash 341621360, now seen corresponding path program 1 times [2022-07-12 01:18:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401595559] [2022-07-12 01:18:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:41,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-12 01:18:41,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:41,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401595559] [2022-07-12 01:18:41,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401595559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:41,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:41,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:18:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196749149] [2022-07-12 01:18:41,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:41,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:18:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:18:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:18:41,858 INFO L87 Difference]: Start difference. First operand 22234 states and 23185 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 01:18:43,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:43,167 INFO L93 Difference]: Finished difference Result 44956 states and 46868 transitions. [2022-07-12 01:18:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 01:18:43,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 865 [2022-07-12 01:18:43,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:43,191 INFO L225 Difference]: With dead ends: 44956 [2022-07-12 01:18:43,191 INFO L226 Difference]: Without dead ends: 23023 [2022-07-12 01:18:43,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:43,203 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 314 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:43,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 627 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 01:18:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23023 states. [2022-07-12 01:18:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23023 to 22834. [2022-07-12 01:18:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22834 states, 22833 states have (on average 1.041869224368239) internal successors, (23789), 22833 states have internal predecessors, (23789), 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 01:18:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22834 states to 22834 states and 23789 transitions. [2022-07-12 01:18:43,407 INFO L78 Accepts]: Start accepts. Automaton has 22834 states and 23789 transitions. Word has length 865 [2022-07-12 01:18:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:43,408 INFO L495 AbstractCegarLoop]: Abstraction has 22834 states and 23789 transitions. [2022-07-12 01:18:43,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 01:18:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 22834 states and 23789 transitions. [2022-07-12 01:18:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2022-07-12 01:18:43,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:43,420 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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] [2022-07-12 01:18:43,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 01:18:43,421 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1669164797, now seen corresponding path program 1 times [2022-07-12 01:18:43,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:43,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904077335] [2022-07-12 01:18:43,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-12 01:18:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:43,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904077335] [2022-07-12 01:18:43,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904077335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:43,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:43,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:43,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232923641] [2022-07-12 01:18:43,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:43,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:43,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:43,738 INFO L87 Difference]: Start difference. First operand 22834 states and 23789 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 01:18:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:44,765 INFO L93 Difference]: Finished difference Result 45663 states and 47588 transitions. [2022-07-12 01:18:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 895 [2022-07-12 01:18:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:44,788 INFO L225 Difference]: With dead ends: 45663 [2022-07-12 01:18:44,788 INFO L226 Difference]: Without dead ends: 23130 [2022-07-12 01:18:44,799 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 01:18:44,800 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 246 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:44,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 454 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 01:18:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2022-07-12 01:18:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 21634. [2022-07-12 01:18:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21634 states, 21633 states have (on average 1.0413719779965793) internal successors, (22528), 21633 states have internal predecessors, (22528), 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 01:18:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21634 states to 21634 states and 22528 transitions. [2022-07-12 01:18:45,005 INFO L78 Accepts]: Start accepts. Automaton has 21634 states and 22528 transitions. Word has length 895 [2022-07-12 01:18:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:45,006 INFO L495 AbstractCegarLoop]: Abstraction has 21634 states and 22528 transitions. [2022-07-12 01:18:45,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 01:18:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 21634 states and 22528 transitions. [2022-07-12 01:18:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-07-12 01:18:45,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:45,018 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:45,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 01:18:45,018 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:45,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1629824559, now seen corresponding path program 1 times [2022-07-12 01:18:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839992189] [2022-07-12 01:18:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 871 proven. 531 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 01:18:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:45,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839992189] [2022-07-12 01:18:45,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839992189] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:45,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980406197] [2022-07-12 01:18:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:45,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:45,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:45,444 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:18:45,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 01:18:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:45,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 01:18:45,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 01:18:45,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 01:18:45,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980406197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:45,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 01:18:45,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-12 01:18:45,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424688994] [2022-07-12 01:18:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:45,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:45,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:45,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:18:45,971 INFO L87 Difference]: Start difference. First operand 21634 states and 22528 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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 01:18:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:46,878 INFO L93 Difference]: Finished difference Result 42666 states and 44447 transitions. [2022-07-12 01:18:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:46,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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 900 [2022-07-12 01:18:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:46,899 INFO L225 Difference]: With dead ends: 42666 [2022-07-12 01:18:46,899 INFO L226 Difference]: Without dead ends: 21333 [2022-07-12 01:18:46,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 01:18:46,912 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 226 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:46,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 461 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 01:18:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21333 states. [2022-07-12 01:18:47,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21333 to 21333. [2022-07-12 01:18:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21333 states, 21332 states have (on average 1.0318769923120195) internal successors, (22012), 21332 states have internal predecessors, (22012), 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 01:18:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22012 transitions. [2022-07-12 01:18:47,101 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22012 transitions. Word has length 900 [2022-07-12 01:18:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22012 transitions. [2022-07-12 01:18:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 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 01:18:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22012 transitions. [2022-07-12 01:18:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2022-07-12 01:18:47,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:47,114 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, 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, 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, 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] [2022-07-12 01:18:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 01:18:47,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 01:18:47,315 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:47,315 INFO L85 PathProgramCache]: Analyzing trace with hash -470354541, now seen corresponding path program 1 times [2022-07-12 01:18:47,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537892876] [2022-07-12 01:18:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:47,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2022-07-12 01:18:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537892876] [2022-07-12 01:18:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537892876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:47,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:47,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 01:18:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053923282] [2022-07-12 01:18:47,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:47,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:18:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:47,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:18:47,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:47,796 INFO L87 Difference]: Start difference. First operand 21333 states and 22012 transitions. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 01:18:49,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:49,482 INFO L93 Difference]: Finished difference Result 44646 states and 46038 transitions. [2022-07-12 01:18:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 01:18:49,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 919 [2022-07-12 01:18:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:49,506 INFO L225 Difference]: With dead ends: 44646 [2022-07-12 01:18:49,506 INFO L226 Difference]: Without dead ends: 23614 [2022-07-12 01:18:49,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:18:49,521 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 632 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:49,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 617 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 01:18:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23614 states. [2022-07-12 01:18:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23614 to 21333. [2022-07-12 01:18:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21333 states, 21332 states have (on average 1.0318301143821489) internal successors, (22011), 21332 states have internal predecessors, (22011), 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 01:18:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22011 transitions. [2022-07-12 01:18:49,714 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22011 transitions. Word has length 919 [2022-07-12 01:18:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:49,715 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22011 transitions. [2022-07-12 01:18:49,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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 01:18:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22011 transitions. [2022-07-12 01:18:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2022-07-12 01:18:49,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:49,729 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 01:18:49,729 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1011364661, now seen corresponding path program 1 times [2022-07-12 01:18:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006165491] [2022-07-12 01:18:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 1270 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-12 01:18:50,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:50,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006165491] [2022-07-12 01:18:50,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006165491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:50,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:50,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 01:18:50,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118908598] [2022-07-12 01:18:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 01:18:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 01:18:50,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 01:18:50,121 INFO L87 Difference]: Start difference. First operand 21333 states and 22011 transitions. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 01:18:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:51,681 INFO L93 Difference]: Finished difference Result 43731 states and 45101 transitions. [2022-07-12 01:18:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 01:18:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 952 [2022-07-12 01:18:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:51,702 INFO L225 Difference]: With dead ends: 43731 [2022-07-12 01:18:51,702 INFO L226 Difference]: Without dead ends: 22699 [2022-07-12 01:18:51,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 01:18:51,714 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 529 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:51,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 01:18:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22699 states. [2022-07-12 01:18:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22699 to 18630. [2022-07-12 01:18:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18630 states, 18629 states have (on average 1.0338182403779055) internal successors, (19259), 18629 states have internal predecessors, (19259), 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 01:18:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18630 states to 18630 states and 19259 transitions. [2022-07-12 01:18:51,888 INFO L78 Accepts]: Start accepts. Automaton has 18630 states and 19259 transitions. Word has length 952 [2022-07-12 01:18:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:51,888 INFO L495 AbstractCegarLoop]: Abstraction has 18630 states and 19259 transitions. [2022-07-12 01:18:51,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 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 01:18:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18630 states and 19259 transitions. [2022-07-12 01:18:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2022-07-12 01:18:51,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:51,903 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:51,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 01:18:51,904 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1022383996, now seen corresponding path program 1 times [2022-07-12 01:18:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:51,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365229895] [2022-07-12 01:18:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1459 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2022-07-12 01:18:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:52,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365229895] [2022-07-12 01:18:52,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365229895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:52,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:52,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613942396] [2022-07-12 01:18:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:52,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:52,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:52,209 INFO L87 Difference]: Start difference. First operand 18630 states and 19259 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 01:18:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:53,045 INFO L93 Difference]: Finished difference Result 36959 states and 38215 transitions. [2022-07-12 01:18:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 1012 [2022-07-12 01:18:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:53,061 INFO L225 Difference]: With dead ends: 36959 [2022-07-12 01:18:53,061 INFO L226 Difference]: Without dead ends: 18630 [2022-07-12 01:18:53,072 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 01:18:53,072 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 239 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:53,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 491 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 01:18:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2022-07-12 01:18:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 18030. [2022-07-12 01:18:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 1.028454157191192) internal successors, (18542), 18029 states have internal predecessors, (18542), 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 01:18:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 18542 transitions. [2022-07-12 01:18:53,281 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 18542 transitions. Word has length 1012 [2022-07-12 01:18:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:53,281 INFO L495 AbstractCegarLoop]: Abstraction has 18030 states and 18542 transitions. [2022-07-12 01:18:53,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 01:18:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 18542 transitions. [2022-07-12 01:18:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2022-07-12 01:18:53,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:53,293 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:18:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 01:18:53,293 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1553755039, now seen corresponding path program 1 times [2022-07-12 01:18:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:53,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938822299] [2022-07-12 01:18:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2022-07-12 01:18:53,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938822299] [2022-07-12 01:18:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938822299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:18:53,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:18:53,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 01:18:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879725974] [2022-07-12 01:18:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:18:53,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 01:18:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:53,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 01:18:53,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 01:18:53,584 INFO L87 Difference]: Start difference. First operand 18030 states and 18542 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 01:18:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:18:54,302 INFO L93 Difference]: Finished difference Result 30641 states and 31385 transitions. [2022-07-12 01:18:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 01:18:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 1013 [2022-07-12 01:18:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:18:54,317 INFO L225 Difference]: With dead ends: 30641 [2022-07-12 01:18:54,317 INFO L226 Difference]: Without dead ends: 12912 [2022-07-12 01:18:54,327 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 01:18:54,328 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 323 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 01:18:54,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 70 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 01:18:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-07-12 01:18:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 11409. [2022-07-12 01:18:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11409 states, 11408 states have (on average 1.0170056100981768) internal successors, (11602), 11408 states have internal predecessors, (11602), 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 01:18:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11409 states to 11409 states and 11602 transitions. [2022-07-12 01:18:54,416 INFO L78 Accepts]: Start accepts. Automaton has 11409 states and 11602 transitions. Word has length 1013 [2022-07-12 01:18:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:18:54,416 INFO L495 AbstractCegarLoop]: Abstraction has 11409 states and 11602 transitions. [2022-07-12 01:18:54,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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 01:18:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11409 states and 11602 transitions. [2022-07-12 01:18:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2022-07-12 01:18:54,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:18:54,428 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, 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, 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, 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, 4, 4, 4, 4, 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, 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] [2022-07-12 01:18:54,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 01:18:54,429 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:18:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:18:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1574290295, now seen corresponding path program 1 times [2022-07-12 01:18:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:18:54,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392113827] [2022-07-12 01:18:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:18:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1488 proven. 187 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-12 01:18:54,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:18:54,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392113827] [2022-07-12 01:18:54,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392113827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 01:18:54,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836818403] [2022-07-12 01:18:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:18:54,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 01:18:54,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 01:18:54,958 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 01:18:55,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 01:18:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:18:55,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 01:18:55,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 01:18:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-07-12 01:18:55,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 01:18:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-07-12 01:18:55,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836818403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 01:18:55,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 01:18:55,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-07-12 01:18:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716640571] [2022-07-12 01:18:55,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 01:18:55,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 01:18:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:18:55,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 01:18:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 01:18:55,859 INFO L87 Difference]: Start difference. First operand 11409 states and 11602 transitions. Second operand has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 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 01:19:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:19:08,597 INFO L93 Difference]: Finished difference Result 34979 states and 35549 transitions. [2022-07-12 01:19:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-12 01:19:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 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 1166 [2022-07-12 01:19:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:19:08,615 INFO L225 Difference]: With dead ends: 34979 [2022-07-12 01:19:08,615 INFO L226 Difference]: Without dead ends: 23871 [2022-07-12 01:19:08,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2441 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1010, Invalid=4392, Unknown=0, NotChecked=0, Total=5402 [2022-07-12 01:19:08,621 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14426 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 20840 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14426 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 21797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 20840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-12 01:19:08,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14426 Valid, 363 Invalid, 21797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [957 Valid, 20840 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-07-12 01:19:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23871 states. [2022-07-12 01:19:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23871 to 11104. [2022-07-12 01:19:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11104 states, 11103 states have (on average 1.0133297307034135) internal successors, (11251), 11103 states have internal predecessors, (11251), 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 01:19:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 11251 transitions. [2022-07-12 01:19:08,750 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 11251 transitions. Word has length 1166 [2022-07-12 01:19:08,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:19:08,751 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 11251 transitions. [2022-07-12 01:19:08,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 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 01:19:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 11251 transitions. [2022-07-12 01:19:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2022-07-12 01:19:08,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 01:19:08,764 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:19:08,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 01:19:08,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 01:19:08,966 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 01:19:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 01:19:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 550818549, now seen corresponding path program 1 times [2022-07-12 01:19:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 01:19:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792263143] [2022-07-12 01:19:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 01:19:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 01:19:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 01:19:09,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2022-07-12 01:19:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 01:19:09,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792263143] [2022-07-12 01:19:09,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792263143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 01:19:09,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 01:19:09,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 01:19:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473380963] [2022-07-12 01:19:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 01:19:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 01:19:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 01:19:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 01:19:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 01:19:09,418 INFO L87 Difference]: Start difference. First operand 11104 states and 11251 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 01:19:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 01:19:10,565 INFO L93 Difference]: Finished difference Result 14104 states and 14288 transitions. [2022-07-12 01:19:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 01:19:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 1223 [2022-07-12 01:19:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 01:19:10,566 INFO L225 Difference]: With dead ends: 14104 [2022-07-12 01:19:10,567 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 01:19:10,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 01:19:10,571 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 396 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 01:19:10,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 50 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 01:19:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 01:19:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 01:19:10,572 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 01:19:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 01:19:10,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1223 [2022-07-12 01:19:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 01:19:10,573 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 01:19:10,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 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 01:19:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 01:19:10,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 01:19:10,575 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 01:19:10,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 01:19:10,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 01:19:41,565 WARN L233 SmtUtils]: Spent 28.38s on a formula simplification. DAG size of input: 782 DAG size of output: 758 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 01:20:10,777 WARN L233 SmtUtils]: Spent 29.21s on a formula simplification. DAG size of input: 779 DAG size of output: 758 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-12 01:20:22,453 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,453 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-07-12 01:20:22,454 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-12 01:20:22,455 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,456 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,457 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,458 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,459 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed. [2022-07-12 01:20:22,460 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,461 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed. [2022-07-12 01:20:22,462 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,463 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 182) no Hoare annotation was computed. [2022-07-12 01:20:22,464 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed. [2022-07-12 01:20:22,465 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,466 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,467 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,468 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed. [2022-07-12 01:20:22,469 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-07-12 01:20:22,470 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-12 01:20:22,471 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-07-12 01:20:22,472 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-12 01:20:22,473 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,474 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed. [2022-07-12 01:20:22,475 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,476 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,477 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,478 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-07-12 01:20:22,479 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed. [2022-07-12 01:20:22,480 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-12 01:20:22,481 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-07-12 01:20:22,483 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,483 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed. [2022-07-12 01:20:22,484 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,485 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,486 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,486 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,486 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed. [2022-07-12 01:20:22,487 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,488 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,488 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,488 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,489 INFO L895 garLoopResultBuilder]: At program point L1767(lines 1668 1768) the Hoare annotation is: (let ((.cse33 (+ ~a4~0 86)) (.cse17 (+ ~a29~0 127))) (let ((.cse1 (<= (+ 89 ~a4~0) 0)) (.cse8 (<= 0 .cse17)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse26 (<= .cse33 0))) (let ((.cse20 (+ ~a29~0 144)) (.cse23 (or (and .cse8 .cse1) (and .cse8 .cse34 .cse26))) (.cse11 (<= 5 ~a2~0)) (.cse15 (<= ~a2~0 2)) (.cse19 (= 3 ~a2~0)) (.cse31 (+ ~a29~0 16))) (let ((.cse9 (not .cse26)) (.cse0 (= ~a2~0 4)) (.cse5 (<= .cse31 0)) (.cse22 (<= 44 ~a29~0)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse28 (or (and .cse8 .cse26 .cse19) (and .cse1 .cse19))) (.cse13 (<= 2 ~a2~0)) (.cse18 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse10 (<= (+ 98 ~a0~0) 0)) (.cse29 (or (and .cse34 .cse26 .cse15) (and .cse1 .cse15))) (.cse27 (<= (+ ~a0~0 61) 0)) (.cse32 (or (and .cse23 .cse11) (and .cse1 .cse11))) (.cse21 (< 0 .cse20)) (.cse16 (= ~a2~0 1)) (.cse24 (<= ~a29~0 43)) (.cse12 (< 0 .cse33)) (.cse7 (<= (+ 42 ~a4~0) 0)) (.cse25 (<= (+ ~a0~0 99) 0)) (.cse2 (<= 0 (+ 146 ~a0~0))) (.cse6 (<= 0 (+ 599999 ~a29~0)))) (or (and .cse0 (or (and .cse1 .cse2) (and .cse1 (exists ((v_~a29~0_899 Int)) (let ((.cse4 (* 9 v_~a29~0_899))) (let ((.cse3 (mod (+ (div .cse4 10) 1) 63))) (and (<= .cse3 (+ ~a29~0 143)) (not (= (mod .cse4 10) 0)) (not (= .cse3 0)) (< .cse4 0))))))) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse7 .cse13 .cse14 .cse15 .cse6) (and .cse8 .cse1 .cse16 (<= 0 (+ 44 ~a0~0)) (<= .cse17 0)) (and .cse12 .cse7 .cse14 .cse18 .cse19) (and .cse7 .cse9 .cse14 .cse11 (not (<= .cse20 0))) (and (<= (+ 216075 ~a0~0) 0) .cse7 .cse16 .cse21) (and .cse7 .cse22 .cse14 .cse11) (and .cse7 .cse8 .cse14 .cse19) (and .cse23 .cse0 .cse24) (and .cse7 .cse25 .cse9 .cse2 .cse19) (and .cse12 .cse7 .cse14 .cse0 .cse6) (and .cse16 .cse26 .cse27) (and .cse12 .cse7 .cse10 (<= (+ ~a29~0 120873) 0) .cse19) (and (<= 0 (+ 97 ~a0~0)) .cse7 .cse16 .cse21 .cse5 .cse27) (and .cse7 .cse22 .cse14 .cse16) (and .cse28 .cse27) (and .cse7 .cse10 .cse2 .cse16 .cse24 .cse6) (and .cse28 .cse6) (and .cse1 .cse2 .cse27) (and .cse13 .cse29 .cse6) (let ((.cse30 (< 0 .cse31))) (and .cse12 (or .cse18 .cse30) .cse7 (= 2 ~a2~0) .cse8 .cse10 (or .cse30 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))))) (and .cse29 .cse27) (and .cse23 .cse27) (and .cse32 .cse27) (and .cse32 .cse21) (and .cse12 .cse7 .cse8 .cse16 .cse24) (and .cse12 .cse7 .cse25 .cse2 .cse11 .cse6)))))) [2022-07-12 01:20:22,490 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-07-12 01:20:22,490 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-12 01:20:22,490 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,490 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,490 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed. [2022-07-12 01:20:22,491 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,492 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed. [2022-07-12 01:20:22,493 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,494 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L895 garLoopResultBuilder]: At program point L1776-2(lines 1776 1785) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86)) (.cse17 (+ ~a29~0 127))) (let ((.cse1 (<= (+ 89 ~a4~0) 0)) (.cse8 (<= 0 .cse17)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse29 (<= .cse35 0)) (.cse36 (+ ~a29~0 144))) (let ((.cse25 (<= .cse36 0)) (.cse18 (or (and .cse8 .cse1) (and .cse8 .cse34 .cse29))) (.cse11 (<= 5 ~a2~0)) (.cse15 (<= ~a2~0 2)) (.cse24 (= 3 ~a2~0))) (let ((.cse19 (<= 4 ~a2~0)) (.cse28 (<= (+ ~a0~0 99) 0)) (.cse0 (= ~a2~0 4)) (.cse23 (< 0 .cse36)) (.cse27 (<= 44 ~a29~0)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse12 (< 0 .cse35)) (.cse26 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse5 (<= (+ ~a29~0 16) 0)) (.cse10 (<= (+ 98 ~a0~0) 0)) (.cse7 (<= (+ 42 ~a4~0) 0)) (.cse9 (not .cse29)) (.cse20 (<= ~a29~0 43)) (.cse31 (or (and .cse8 .cse29 .cse24) (and .cse1 .cse24))) (.cse16 (= ~a2~0 1)) (.cse2 (<= 0 (+ 146 ~a0~0))) (.cse13 (<= 2 ~a2~0)) (.cse6 (<= 0 (+ 599999 ~a29~0))) (.cse32 (or (and .cse34 .cse29 .cse15) (and .cse1 .cse15))) (.cse21 (<= (+ ~a0~0 61) 0)) (.cse33 (or (and .cse18 .cse11) (and .cse1 .cse11))) (.cse22 (not .cse25))) (or (and .cse0 (or (and .cse1 .cse2) (and .cse1 (exists ((v_~a29~0_899 Int)) (let ((.cse4 (* 9 v_~a29~0_899))) (let ((.cse3 (mod (+ (div .cse4 10) 1) 63))) (and (<= .cse3 (+ ~a29~0 143)) (not (= (mod .cse4 10) 0)) (not (= .cse3 0)) (< .cse4 0))))))) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse7 .cse13 .cse14 .cse15 .cse6) (and .cse8 .cse1 .cse16 (<= 0 (+ 44 ~a0~0)) (<= .cse17 0)) (and .cse18 .cse19 .cse20) (and .cse8 .cse1 .cse21) (and .cse7 .cse9 .cse14 .cse11 .cse22) (and (<= (+ 216075 ~a0~0) 0) .cse7 .cse16 .cse23) (and .cse7 (or (and .cse12 .cse14 .cse24 .cse25) (and .cse9 .cse14 .cse26 .cse24))) (and .cse7 .cse27 .cse14 .cse11) (and .cse7 .cse8 .cse14 .cse24) (and .cse12 .cse7 .cse28 .cse2 (not .cse0) .cse19 .cse6) (and .cse7 .cse28 .cse9 .cse2 .cse24) (and .cse12 .cse7 .cse14 .cse0 .cse6) (and .cse16 .cse29 .cse21) (and .cse12 .cse7 .cse10 (<= (+ ~a29~0 120873) 0) .cse24) (and (<= 0 (+ 97 ~a0~0)) .cse7 .cse16 .cse23 .cse5 .cse21) (and .cse7 .cse27 .cse14 .cse16) (let ((.cse30 (not .cse5))) (and .cse12 .cse7 .cse13 .cse8 .cse10 (or .cse30 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse30 .cse26) .cse15)) (and .cse31 .cse21) (and .cse7 .cse10 .cse2 .cse16 .cse20 .cse6) (and .cse7 .cse8 .cse9 .cse16 .cse20) (and .cse31 .cse6) (and .cse16 .cse29 .cse25) (and .cse1 .cse2 .cse21) (and .cse13 .cse32 .cse6) (and .cse32 .cse21) (and .cse33 .cse21) (and .cse33 .cse22)))))) [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,495 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,496 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-07-12 01:20:22,497 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-07-12 01:20:22,498 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,499 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,500 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,501 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,501 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-07-12 01:20:22,501 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-07-12 01:20:22,501 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed. [2022-07-12 01:20:22,502 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,503 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,504 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,504 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,504 INFO L895 garLoopResultBuilder]: At program point L1665(lines 33 1666) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86)) (.cse17 (+ ~a29~0 127))) (let ((.cse1 (<= (+ 89 ~a4~0) 0)) (.cse8 (<= 0 .cse17)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse29 (<= .cse35 0)) (.cse36 (+ ~a29~0 144))) (let ((.cse25 (<= .cse36 0)) (.cse18 (or (and .cse8 .cse1) (and .cse8 .cse34 .cse29))) (.cse11 (<= 5 ~a2~0)) (.cse15 (<= ~a2~0 2)) (.cse24 (= 3 ~a2~0))) (let ((.cse19 (<= 4 ~a2~0)) (.cse28 (<= (+ ~a0~0 99) 0)) (.cse0 (= ~a2~0 4)) (.cse23 (< 0 .cse36)) (.cse27 (<= 44 ~a29~0)) (.cse14 (<= (+ ~a0~0 147) 0)) (.cse12 (< 0 .cse35)) (.cse26 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse5 (<= (+ ~a29~0 16) 0)) (.cse10 (<= (+ 98 ~a0~0) 0)) (.cse7 (<= (+ 42 ~a4~0) 0)) (.cse9 (not .cse29)) (.cse20 (<= ~a29~0 43)) (.cse31 (or (and .cse8 .cse29 .cse24) (and .cse1 .cse24))) (.cse16 (= ~a2~0 1)) (.cse2 (<= 0 (+ 146 ~a0~0))) (.cse13 (<= 2 ~a2~0)) (.cse6 (<= 0 (+ 599999 ~a29~0))) (.cse32 (or (and .cse34 .cse29 .cse15) (and .cse1 .cse15))) (.cse21 (<= (+ ~a0~0 61) 0)) (.cse33 (or (and .cse18 .cse11) (and .cse1 .cse11))) (.cse22 (not .cse25))) (or (and .cse0 (or (and .cse1 .cse2) (and .cse1 (exists ((v_~a29~0_899 Int)) (let ((.cse4 (* 9 v_~a29~0_899))) (let ((.cse3 (mod (+ (div .cse4 10) 1) 63))) (and (<= .cse3 (+ ~a29~0 143)) (not (= (mod .cse4 10) 0)) (not (= .cse3 0)) (< .cse4 0))))))) .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse7 .cse13 .cse14 .cse15 .cse6) (and .cse8 .cse1 .cse16 (<= 0 (+ 44 ~a0~0)) (<= .cse17 0)) (and .cse18 .cse19 .cse20) (and .cse8 .cse1 .cse21) (and .cse7 .cse9 .cse14 .cse11 .cse22) (and (<= (+ 216075 ~a0~0) 0) .cse7 .cse16 .cse23) (and .cse7 (or (and .cse12 .cse14 .cse24 .cse25) (and .cse9 .cse14 .cse26 .cse24))) (and .cse7 .cse27 .cse14 .cse11) (and .cse7 .cse8 .cse14 .cse24) (and .cse12 .cse7 .cse28 .cse2 (not .cse0) .cse19 .cse6) (and .cse7 .cse28 .cse9 .cse2 .cse24) (and .cse12 .cse7 .cse14 .cse0 .cse6) (and .cse16 .cse29 .cse21) (and .cse12 .cse7 .cse10 (<= (+ ~a29~0 120873) 0) .cse24) (and (<= 0 (+ 97 ~a0~0)) .cse7 .cse16 .cse23 .cse5 .cse21) (and .cse7 .cse27 .cse14 .cse16) (let ((.cse30 (not .cse5))) (and .cse12 .cse7 .cse13 .cse8 .cse10 (or .cse30 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse30 .cse26) .cse15)) (and .cse31 .cse21) (and .cse7 .cse10 .cse2 .cse16 .cse20 .cse6) (and .cse7 .cse8 .cse9 .cse16 .cse20) (and .cse31 .cse6) (and .cse16 .cse29 .cse25) (and .cse1 .cse2 .cse21) (and .cse13 .cse32 .cse6) (and .cse32 .cse21) (and .cse33 .cse21) (and .cse33 .cse22)))))) [2022-07-12 01:20:22,504 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-12 01:20:22,504 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-07-12 01:20:22,504 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,505 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,505 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,505 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,505 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,505 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed. [2022-07-12 01:20:22,506 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 01:20:22,507 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed. [2022-07-12 01:20:22,508 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,509 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-07-12 01:20:22,510 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,511 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed. [2022-07-12 01:20:22,512 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,513 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-07-12 01:20:22,513 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed. [2022-07-12 01:20:22,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 01:20:22,517 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 01:20:22,530 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,531 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,554 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,555 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,555 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,555 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,564 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,574 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 01:20:22 BoogieIcfgContainer [2022-07-12 01:20:22,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 01:20:22,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 01:20:22,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 01:20:22,577 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 01:20:22,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:17:56" (3/4) ... [2022-07-12 01:20:22,580 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 01:20:22,602 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 01:20:22,608 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-12 01:20:22,610 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 01:20:22,611 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 01:20:22,635 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) [2022-07-12 01:20:22,639 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) [2022-07-12 01:20:22,650 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a2 == 4) && a29 <= 43)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) [2022-07-12 01:20:22,750 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 01:20:22,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 01:20:22,752 INFO L158 Benchmark]: Toolchain (without parser) took 150412.18ms. Allocated memory was 107.0MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 73.3MB in the beginning and 1.0GB in the end (delta: -949.5MB). Peak memory consumption was 511.5MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,752 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 01:20:22,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.79ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 73.3MB in the beginning and 72.9MB in the end (delta: 401.6kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.26ms. Allocated memory is still 134.2MB. Free memory was 72.9MB in the beginning and 65.9MB in the end (delta: 7.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,754 INFO L158 Benchmark]: Boogie Preprocessor took 213.76ms. Allocated memory is still 134.2MB. Free memory was 65.9MB in the beginning and 66.8MB in the end (delta: -802.6kB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,755 INFO L158 Benchmark]: RCFGBuilder took 2618.54ms. Allocated memory was 134.2MB in the beginning and 260.0MB in the end (delta: 125.8MB). Free memory was 66.8MB in the beginning and 181.6MB in the end (delta: -114.9MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,760 INFO L158 Benchmark]: TraceAbstraction took 146376.99ms. Allocated memory was 260.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 180.6MB in the beginning and 1.0GB in the end (delta: -866.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-07-12 01:20:22,761 INFO L158 Benchmark]: Witness Printer took 174.29ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-12 01:20:22,763 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.22ms. Allocated memory is still 107.0MB. Free memory was 64.2MB in the beginning and 64.2MB in the end (delta: 25.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 834.79ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 73.3MB in the beginning and 72.9MB in the end (delta: 401.6kB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.26ms. Allocated memory is still 134.2MB. Free memory was 72.9MB in the beginning and 65.9MB in the end (delta: 7.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 213.76ms. Allocated memory is still 134.2MB. Free memory was 65.9MB in the beginning and 66.8MB in the end (delta: -802.6kB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2618.54ms. Allocated memory was 134.2MB in the beginning and 260.0MB in the end (delta: 125.8MB). Free memory was 66.8MB in the beginning and 181.6MB in the end (delta: -114.9MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 146376.99ms. Allocated memory was 260.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 180.6MB in the beginning and 1.0GB in the end (delta: -866.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 174.29ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] * 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: 182]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 146.3s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 55.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 71.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25207 SdHoareTripleChecker+Valid, 49.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25207 mSDsluCounter, 11117 SdHoareTripleChecker+Invalid, 41.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 785 IncrementalHoareTripleChecker+Unchecked, 1797 mSDsCounter, 6148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54169 IncrementalHoareTripleChecker+Invalid, 61102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6148 mSolverCounterUnsat, 9320 mSDtfsCounter, 54169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6866 GetRequests, 6720 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22834occurred in iteration=21, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 40076 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 204 NumberOfFragments, 2495 HoareAnnotationTreeSize, 4 FomulaSimplifications, 736938 FormulaSimplificationTreeSizeReduction, 60.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1136256 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 23073 NumberOfCodeBlocks, 23073 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 24878 ConstructedInterpolants, 53 QuantifiedInterpolants, 83791 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5770 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 37 InterpolantComputations, 27 PerfectInterpolantSequences, 36001/37438 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: 1770]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1668]: Loop Invariant [2022-07-12 01:20:22,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,777 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a2 == 4) && a29 <= 43)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) - InvariantResult [Line: 1776]: Loop Invariant [2022-07-12 01:20:22,778 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,779 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,782 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) - InvariantResult [Line: 33]: Loop Invariant [2022-07-12 01:20:22,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-12 01:20:22,785 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((a2 == 4 && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !(9 * v_~a29~0_899 % 10 == 0)) && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0)) && 9 * v_~a29~0_899 < 0)))) && a29 + 16 <= 0) && 0 <= 599999 + a29) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) RESULT: Ultimate proved your program to be correct! [2022-07-12 01:20:22,804 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