./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31179e70784aebb46d762aef4da1a2ff63bbff38 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:36,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:36,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:36,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:36,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:36,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:36,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:36,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:36,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:36,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:36,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:36,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:36,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:36,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:36,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:36,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:36,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:36,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:36,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:36,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:36,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:36,827 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:36,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:36,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:36,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:36,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:36,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:36,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:36,836 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:36,837 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:36,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:36,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:36,838 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:36,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:36,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:36,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:36,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:36,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:36,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:36,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:36,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:36,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:36,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:36,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:36,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:36,857 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:36,857 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:36,857 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:36,857 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:36,857 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:36,858 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:36,858 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:36,858 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:36,858 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:36,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:36,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:36,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:36,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:36,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:36,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:36,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:36,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:36,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:36,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:36,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:36,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:36,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:36,863 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:36,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:36,864 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:36,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:36,864 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 31179e70784aebb46d762aef4da1a2ff63bbff38 [2019-10-22 11:21:36,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:36,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:36,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:36,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:36,906 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:36,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-10-22 11:21:36,953 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/data/716fe6ef3/9e96e09dfb784cef9f37eee4ac73fce8/FLAG1509cc83a [2019-10-22 11:21:37,423 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:37,424 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-10-22 11:21:37,438 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/data/716fe6ef3/9e96e09dfb784cef9f37eee4ac73fce8/FLAG1509cc83a [2019-10-22 11:21:37,746 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/data/716fe6ef3/9e96e09dfb784cef9f37eee4ac73fce8 [2019-10-22 11:21:37,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:37,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:37,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:37,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:37,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:37,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:37" (1/1) ... [2019-10-22 11:21:37,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ebe14f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:37, skipping insertion in model container [2019-10-22 11:21:37,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:37" (1/1) ... [2019-10-22 11:21:37,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:37,816 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:38,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:38,195 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:38,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:38,328 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:38,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38 WrapperNode [2019-10-22 11:21:38,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:38,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:38,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:38,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:38,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:38,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:38,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:38,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:38,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,486 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... [2019-10-22 11:21:38,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:38,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:38,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:38,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:38,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:38,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:38,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:39,545 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:39,546 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:21:39,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:39 BoogieIcfgContainer [2019-10-22 11:21:39,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:39,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:39,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:39,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:39,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:37" (1/3) ... [2019-10-22 11:21:39,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fd48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:39, skipping insertion in model container [2019-10-22 11:21:39,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:38" (2/3) ... [2019-10-22 11:21:39,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fd48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:39, skipping insertion in model container [2019-10-22 11:21:39,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:39" (3/3) ... [2019-10-22 11:21:39,557 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2019-10-22 11:21:39,567 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:39,575 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:21:39,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:21:39,620 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:39,620 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:39,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:39,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:39,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:39,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:39,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:39,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:21:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-22 11:21:39,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:39,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:39,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:39,666 INFO L82 PathProgramCache]: Analyzing trace with hash -286092569, now seen corresponding path program 1 times [2019-10-22 11:21:39,676 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:39,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725599487] [2019-10-22 11:21:39,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,677 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:39,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:40,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:40,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725599487] [2019-10-22 11:21:40,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:40,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:40,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511057540] [2019-10-22 11:21:40,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:40,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:40,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:40,179 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 11:21:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:41,400 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-10-22 11:21:41,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:41,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-22 11:21:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:41,424 INFO L225 Difference]: With dead ends: 687 [2019-10-22 11:21:41,424 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 11:21:41,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 11:21:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-10-22 11:21:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 11:21:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 11:21:41,509 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 118 [2019-10-22 11:21:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:41,510 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 11:21:41,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 11:21:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 11:21:41,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:41,515 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:41,515 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash 520774714, now seen corresponding path program 1 times [2019-10-22 11:21:41,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:41,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367301896] [2019-10-22 11:21:41,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:41,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:41,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367301896] [2019-10-22 11:21:41,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:41,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:41,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845686130] [2019-10-22 11:21:41,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:41,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:41,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:41,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:41,595 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 11:21:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:42,360 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-10-22 11:21:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:42,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-22 11:21:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:42,364 INFO L225 Difference]: With dead ends: 1054 [2019-10-22 11:21:42,364 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 11:21:42,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 11:21:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-22 11:21:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 11:21:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-10-22 11:21:42,421 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 124 [2019-10-22 11:21:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:42,427 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-10-22 11:21:42,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-10-22 11:21:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 11:21:42,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:42,436 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:42,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1772838714, now seen corresponding path program 1 times [2019-10-22 11:21:42,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:42,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123848106] [2019-10-22 11:21:42,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:42,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:42,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:21:42,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123848106] [2019-10-22 11:21:42,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:42,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:42,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004456978] [2019-10-22 11:21:42,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:42,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:42,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:42,583 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2019-10-22 11:21:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:42,999 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2019-10-22 11:21:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:43,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-22 11:21:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:43,004 INFO L225 Difference]: With dead ends: 2233 [2019-10-22 11:21:43,005 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 11:21:43,011 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 11:21:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-10-22 11:21:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-22 11:21:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2019-10-22 11:21:43,036 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 125 [2019-10-22 11:21:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:43,037 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2019-10-22 11:21:43,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2019-10-22 11:21:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-22 11:21:43,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:43,042 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:21:43,043 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1189668884, now seen corresponding path program 1 times [2019-10-22 11:21:43,043 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:43,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096552962] [2019-10-22 11:21:43,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,044 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:21:43,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096552962] [2019-10-22 11:21:43,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:43,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:43,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961044495] [2019-10-22 11:21:43,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:43,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:43,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:43,099 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2019-10-22 11:21:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:43,563 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2019-10-22 11:21:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:43,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-22 11:21:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:43,568 INFO L225 Difference]: With dead ends: 2757 [2019-10-22 11:21:43,569 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 11:21:43,574 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 11:21:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-10-22 11:21:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-10-22 11:21:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2019-10-22 11:21:43,606 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 141 [2019-10-22 11:21:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:43,608 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2019-10-22 11:21:43,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2019-10-22 11:21:43,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-22 11:21:43,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:43,612 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:43,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1199714519, now seen corresponding path program 1 times [2019-10-22 11:21:43,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:43,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120711008] [2019-10-22 11:21:43,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:43,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-22 11:21:43,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120711008] [2019-10-22 11:21:43,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:43,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:43,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075953830] [2019-10-22 11:21:43,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:43,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:43,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:43,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:43,705 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2019-10-22 11:21:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:44,105 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2019-10-22 11:21:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:44,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-22 11:21:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:44,111 INFO L225 Difference]: With dead ends: 3281 [2019-10-22 11:21:44,112 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 11:21:44,113 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 11:21:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-10-22 11:21:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:21:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2019-10-22 11:21:44,147 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 152 [2019-10-22 11:21:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:44,148 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2019-10-22 11:21:44,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2019-10-22 11:21:44,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-22 11:21:44,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:44,151 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:44,151 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:44,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:44,152 INFO L82 PathProgramCache]: Analyzing trace with hash -336243861, now seen corresponding path program 1 times [2019-10-22 11:21:44,152 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:44,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385803942] [2019-10-22 11:21:44,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:21:44,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385803942] [2019-10-22 11:21:44,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:44,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:44,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395099776] [2019-10-22 11:21:44,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:44,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:44,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:44,245 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2019-10-22 11:21:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:44,694 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2019-10-22 11:21:44,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:44,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-10-22 11:21:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:44,699 INFO L225 Difference]: With dead ends: 3286 [2019-10-22 11:21:44,700 INFO L226 Difference]: Without dead ends: 1712 [2019-10-22 11:21:44,701 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-10-22 11:21:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2019-10-22 11:21:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:21:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-10-22 11:21:44,728 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 160 [2019-10-22 11:21:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:44,728 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-10-22 11:21:44,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-10-22 11:21:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-22 11:21:44,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:44,732 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:44,732 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:44,733 INFO L82 PathProgramCache]: Analyzing trace with hash 897010083, now seen corresponding path program 1 times [2019-10-22 11:21:44,733 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:44,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962319459] [2019-10-22 11:21:44,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,733 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:44,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:21:44,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962319459] [2019-10-22 11:21:44,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:44,810 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:44,810 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717236877] [2019-10-22 11:21:44,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:44,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:44,811 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-10-22 11:21:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,526 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-10-22 11:21:45,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:45,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-10-22 11:21:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,532 INFO L225 Difference]: With dead ends: 3805 [2019-10-22 11:21:45,533 INFO L226 Difference]: Without dead ends: 2231 [2019-10-22 11:21:45,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-10-22 11:21:45,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-10-22 11:21:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-10-22 11:21:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2372 transitions. [2019-10-22 11:21:45,574 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2372 transitions. Word has length 164 [2019-10-22 11:21:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:45,574 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2372 transitions. [2019-10-22 11:21:45,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2372 transitions. [2019-10-22 11:21:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-22 11:21:45,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:45,578 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:45,578 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash -114948098, now seen corresponding path program 1 times [2019-10-22 11:21:45,579 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:45,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200118831] [2019-10-22 11:21:45,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:45,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-22 11:21:45,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200118831] [2019-10-22 11:21:45,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:45,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:45,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233137566] [2019-10-22 11:21:45,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:45,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:45,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:45,620 INFO L87 Difference]: Start difference. First operand 1969 states and 2372 transitions. Second operand 3 states. [2019-10-22 11:21:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:45,976 INFO L93 Difference]: Finished difference Result 4067 states and 4885 transitions. [2019-10-22 11:21:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:45,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-22 11:21:45,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:45,981 INFO L225 Difference]: With dead ends: 4067 [2019-10-22 11:21:45,981 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 11:21:45,983 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 11:21:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-10-22 11:21:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:21:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1860 transitions. [2019-10-22 11:21:46,011 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1860 transitions. Word has length 167 [2019-10-22 11:21:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,011 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1860 transitions. [2019-10-22 11:21:46,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1860 transitions. [2019-10-22 11:21:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-22 11:21:46,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,015 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,015 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash 266977410, now seen corresponding path program 1 times [2019-10-22 11:21:46,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077480293] [2019-10-22 11:21:46,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 11:21:46,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077480293] [2019-10-22 11:21:46,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:46,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:21:46,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140712621] [2019-10-22 11:21:46,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:46,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:46,092 INFO L87 Difference]: Start difference. First operand 1707 states and 1860 transitions. Second operand 3 states. [2019-10-22 11:21:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:46,410 INFO L93 Difference]: Finished difference Result 3412 states and 3718 transitions. [2019-10-22 11:21:46,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:46,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-22 11:21:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:46,415 INFO L225 Difference]: With dead ends: 3412 [2019-10-22 11:21:46,416 INFO L226 Difference]: Without dead ends: 1707 [2019-10-22 11:21:46,418 INFO L600 BasicCegarLoop]: 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 [2019-10-22 11:21:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-10-22 11:21:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2019-10-22 11:21:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:21:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-10-22 11:21:46,453 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 182 [2019-10-22 11:21:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:46,454 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-10-22 11:21:46,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:46,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-10-22 11:21:46,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-22 11:21:46,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:46,460 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:46,460 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:46,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:46,460 INFO L82 PathProgramCache]: Analyzing trace with hash 912734582, now seen corresponding path program 1 times [2019-10-22 11:21:46,460 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:46,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905578792] [2019-10-22 11:21:46,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:46,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-22 11:21:46,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905578792] [2019-10-22 11:21:46,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775287976] [2019-10-22 11:21:46,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:46,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:21:46,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:21:46,828 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-22 11:21:46,897 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:21:46,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-10-22 11:21:46,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600743992] [2019-10-22 11:21:46,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:46,899 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:46,900 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 4 states. [2019-10-22 11:21:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:47,483 INFO L93 Difference]: Finished difference Result 3017 states and 3273 transitions. [2019-10-22 11:21:47,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:47,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-10-22 11:21:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:47,485 INFO L225 Difference]: With dead ends: 3017 [2019-10-22 11:21:47,485 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:21:47,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:21:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:21:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:21:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:21:47,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-10-22 11:21:47,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:47,488 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:21:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:21:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:21:47,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:47,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:21:47,987 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:21:47,987 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:21:47,987 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:21:47,988 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:21:47,989 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:21:47,991 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:21:47,991 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:21:47,991 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:21:47,991 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:21:47,992 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:21:47,993 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:21:47,993 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:21:47,993 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:21:47,993 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:21:47,993 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:21:47,994 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse4 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse1 (not (= ~a16~0 6))) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 (= ~a17~0 1)) (and .cse2 .cse1 .cse3) (and .cse4 .cse3) (and .cse0 .cse4) (and (<= 15 ~a8~0) .cse2 .cse3) (and (< 13 ~a8~0) .cse1 .cse3))) [2019-10-22 11:21:47,994 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:21:47,996 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,997 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,998 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:21:47,999 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse4 (= ~a20~0 1)) (.cse2 (not (= ~a7~0 1))) (.cse1 (not (= ~a16~0 6))) (.cse3 (= ~a21~0 1))) (or (and .cse0 .cse1 (= ~a17~0 1)) (and .cse2 .cse1 .cse3) (and .cse4 .cse3) (and .cse0 .cse4) (and (<= 15 ~a8~0) .cse2 .cse3) (and (< 13 ~a8~0) .cse1 .cse3))) [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:21:48,000 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:21:48,001 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,007 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:21:48,008 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:21:48,009 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:21:48,010 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:21:48,011 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:21:48,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:48 BoogieIcfgContainer [2019-10-22 11:21:48,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:48,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:48,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:48,033 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:48,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:39" (3/4) ... [2019-10-22 11:21:48,037 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:21:48,055 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:21:48,060 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:21:48,208 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bf6c0561-6244-4d06-a838-68706af936fe/bin/utaipan/witness.graphml [2019-10-22 11:21:48,208 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:48,210 INFO L168 Benchmark]: Toolchain (without parser) took 10460.53 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 424.1 MB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -462.5 MB). Peak memory consumption was 389.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,210 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:48,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,211 INFO L168 Benchmark]: Boogie Preprocessor took 70.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,211 INFO L168 Benchmark]: RCFGBuilder took 1047.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,212 INFO L168 Benchmark]: TraceAbstraction took 8483.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 997.9 MB in the beginning and 853.0 MB in the end (delta: 145.0 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,212 INFO L168 Benchmark]: Witness Printer took 175.33 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 138.4 MB). Free memory was 853.0 MB in the beginning and 1.4 GB in the end (delta: -555.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:48,213 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1047.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8483.75 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 997.9 MB in the beginning and 853.0 MB in the end (delta: 145.0 MB). Peak memory consumption was 289.7 MB. Max. memory is 11.5 GB. * Witness Printer took 175.33 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 138.4 MB). Free memory was 853.0 MB in the beginning and 1.4 GB in the end (delta: -555.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((1 == a7 && !(a16 == 6)) && a17 == 1) || ((!(a7 == 1) && !(a16 == 6)) && a21 == 1)) || (a20 == 1 && a21 == 1)) || (1 == a7 && a20 == 1)) || ((15 <= a8 && !(a7 == 1)) && a21 == 1)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((1 == a7 && !(a16 == 6)) && a17 == 1) || ((!(a7 == 1) && !(a16 == 6)) && a21 == 1)) || (a20 == 1 && a21 == 1)) || (1 == a7 && a20 == 1)) || ((15 <= a8 && !(a7 == 1)) && a21 == 1)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.3s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 571 SDtfs, 1714 SDslu, 99 SDs, 0 SdLazy, 4847 SolverSat, 753 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1577 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 54 NumberOfFragments, 121 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6972 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 300 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1755 NumberOfCodeBlocks, 1755 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1954 ConstructedInterpolants, 0 QuantifiedInterpolants, 714671 SizeOfPredicates, 1 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 986/1013 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...