./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label41.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_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label41.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/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 936e1fac1e718929285e646469efe9b1619e10b2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:15,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:25:15,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:25:15,936 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:25:15,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:25:15,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:25:15,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:25:15,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:25:15,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:25:15,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:25:15,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:25:15,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:25:15,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:25:15,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:25:15,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:25:15,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:25:15,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:25:15,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:25:15,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:25:15,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:25:15,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:25:15,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:25:15,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:25:15,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:25:15,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:25:15,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:25:15,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:25:15,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:25:15,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:25:15,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:25:15,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:25:15,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:25:15,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:25:15,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:25:15,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:25:15,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:25:15,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:25:15,974 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:25:15,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:25:15,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:25:15,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:25:15,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:25:15,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:25:15,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:25:15,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:25:15,994 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:25:15,995 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:25:15,995 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:25:15,995 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:25:15,995 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:25:15,995 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:25:15,995 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:25:15,996 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:25:15,996 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:25:15,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:25:15,996 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:25:15,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:25:15,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:25:15,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:25:15,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:25:15,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:25:15,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:25:16,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:25:16,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:25:16,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:25:16,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:25:16,000 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:25:16,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:25:16,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:25:16,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:25:16,001 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_c399db4c-d345-4317-af3f-eb0d4f926945/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 -> 936e1fac1e718929285e646469efe9b1619e10b2 [2019-10-22 11:25:16,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:25:16,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:25:16,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:25:16,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:25:16,057 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:25:16,058 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label41.c [2019-10-22 11:25:16,112 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/data/c8c1b405b/9f40af66bb0d4f2494cf3fd44c4bc8d8/FLAG7cc466959 [2019-10-22 11:25:16,556 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:25:16,557 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/sv-benchmarks/c/eca-rers2012/Problem01_label41.c [2019-10-22 11:25:16,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/data/c8c1b405b/9f40af66bb0d4f2494cf3fd44c4bc8d8/FLAG7cc466959 [2019-10-22 11:25:17,075 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/data/c8c1b405b/9f40af66bb0d4f2494cf3fd44c4bc8d8 [2019-10-22 11:25:17,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:25:17,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:25:17,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:17,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:25:17,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:25:17,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485edf09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17, skipping insertion in model container [2019-10-22 11:25:17,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,093 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:25:17,141 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:25:17,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:17,585 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:25:17,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:25:17,679 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:25:17,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17 WrapperNode [2019-10-22 11:25:17,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:25:17,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:17,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:25:17,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:25:17,689 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:25:17" (1/1) ... [2019-10-22 11:25:17,711 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:25:17" (1/1) ... [2019-10-22 11:25:17,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:25:17,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:25:17,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:25:17,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:25:17,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... [2019-10-22 11:25:17,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:25:17,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:25:17,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:25:17,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:25:17,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/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:25:17,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:25:17,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:25:19,015 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:25:19,015 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 11:25:19,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:19 BoogieIcfgContainer [2019-10-22 11:25:19,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:25:19,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:25:19,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:25:19,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:25:19,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:25:17" (1/3) ... [2019-10-22 11:25:19,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:19, skipping insertion in model container [2019-10-22 11:25:19,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:25:17" (2/3) ... [2019-10-22 11:25:19,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270ea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:25:19, skipping insertion in model container [2019-10-22 11:25:19,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:19" (3/3) ... [2019-10-22 11:25:19,027 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label41.c [2019-10-22 11:25:19,037 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:25:19,044 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:25:19,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:25:19,075 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:25:19,075 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:25:19,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:25:19,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:25:19,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:25:19,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:25:19,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:25:19,076 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:25:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 11:25:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 11:25:19,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:19,099 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] [2019-10-22 11:25:19,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:19,105 INFO L82 PathProgramCache]: Analyzing trace with hash 867355110, now seen corresponding path program 1 times [2019-10-22 11:25:19,116 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:19,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122795253] [2019-10-22 11:25:19,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:19,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:19,476 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:25:19,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122795253] [2019-10-22 11:25:19,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:19,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:19,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642389155] [2019-10-22 11:25:19,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:19,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:19,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:19,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:19,497 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 11:25:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:20,621 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-10-22 11:25:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:20,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-22 11:25:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:20,635 INFO L225 Difference]: With dead ends: 662 [2019-10-22 11:25:20,635 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 11:25:20,638 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:25:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 11:25:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-10-22 11:25:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 11:25:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 11:25:20,683 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 85 [2019-10-22 11:25:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:20,684 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 11:25:20,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 11:25:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-22 11:25:20,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:20,687 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] [2019-10-22 11:25:20,687 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1655802317, now seen corresponding path program 1 times [2019-10-22 11:25:20,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:20,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050182598] [2019-10-22 11:25:20,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:20,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:20,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:20,760 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:25:20,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050182598] [2019-10-22 11:25:20,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:20,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:20,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170245609] [2019-10-22 11:25:20,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:20,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:20,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:20,763 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 11:25:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:21,388 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-10-22 11:25:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:21,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-22 11:25:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:21,393 INFO L225 Difference]: With dead ends: 1054 [2019-10-22 11:25:21,393 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 11:25:21,394 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:25:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 11:25:21,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-22 11:25:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 11:25:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-10-22 11:25:21,430 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 91 [2019-10-22 11:25:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:21,431 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-10-22 11:25:21,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-10-22 11:25:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:25:21,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:21,442 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] [2019-10-22 11:25:21,442 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:21,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:21,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1661592781, now seen corresponding path program 1 times [2019-10-22 11:25:21,443 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:21,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231186106] [2019-10-22 11:25:21,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:21,443 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:21,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:21,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231186106] [2019-10-22 11:25:21,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:21,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:21,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673963578] [2019-10-22 11:25:21,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:21,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:21,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:21,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:21,530 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-10-22 11:25:21,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:21,913 INFO L93 Difference]: Finished difference Result 2102 states and 2850 transitions. [2019-10-22 11:25:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:21,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:25:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:21,918 INFO L225 Difference]: With dead ends: 2102 [2019-10-22 11:25:21,918 INFO L226 Difference]: Without dead ends: 1183 [2019-10-22 11:25:21,924 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:25:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-10-22 11:25:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2019-10-22 11:25:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-10-22 11:25:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1319 transitions. [2019-10-22 11:25:21,959 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1319 transitions. Word has length 92 [2019-10-22 11:25:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:21,960 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1319 transitions. [2019-10-22 11:25:21,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1319 transitions. [2019-10-22 11:25:21,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 11:25:21,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:21,964 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:21,964 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:21,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:21,964 INFO L82 PathProgramCache]: Analyzing trace with hash -539431419, now seen corresponding path program 1 times [2019-10-22 11:25:21,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:21,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806145781] [2019-10-22 11:25:21,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:21,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:21,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:25:22,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806145781] [2019-10-22 11:25:22,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:22,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:25:22,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130215144] [2019-10-22 11:25:22,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:22,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:25:22,022 INFO L87 Difference]: Start difference. First operand 1052 states and 1319 transitions. Second operand 3 states. [2019-10-22 11:25:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:22,437 INFO L93 Difference]: Finished difference Result 2757 states and 3480 transitions. [2019-10-22 11:25:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:22,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 11:25:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:22,445 INFO L225 Difference]: With dead ends: 2757 [2019-10-22 11:25:22,445 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 11:25:22,446 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:25:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 11:25:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-10-22 11:25:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 11:25:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1638 transitions. [2019-10-22 11:25:22,479 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1638 transitions. Word has length 100 [2019-10-22 11:25:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:22,479 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1638 transitions. [2019-10-22 11:25:22,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1638 transitions. [2019-10-22 11:25:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-22 11:25:22,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:22,515 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 11:25:22,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash -36212071, now seen corresponding path program 1 times [2019-10-22 11:25:22,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:22,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293374832] [2019-10-22 11:25:22,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:22,516 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:22,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-22 11:25:22,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293374832] [2019-10-22 11:25:22,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:22,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:25:22,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103078917] [2019-10-22 11:25:22,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:22,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:22,583 INFO L87 Difference]: Start difference. First operand 1445 states and 1638 transitions. Second operand 4 states. [2019-10-22 11:25:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:23,032 INFO L93 Difference]: Finished difference Result 3027 states and 3424 transitions. [2019-10-22 11:25:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:25:23,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-22 11:25:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:23,037 INFO L225 Difference]: With dead ends: 3027 [2019-10-22 11:25:23,037 INFO L226 Difference]: Without dead ends: 1584 [2019-10-22 11:25:23,038 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:25:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-22 11:25:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1576. [2019-10-22 11:25:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:25:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1772 transitions. [2019-10-22 11:25:23,076 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1772 transitions. Word has length 108 [2019-10-22 11:25:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:23,076 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1772 transitions. [2019-10-22 11:25:23,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1772 transitions. [2019-10-22 11:25:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-22 11:25:23,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:23,079 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:23,079 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1928303825, now seen corresponding path program 1 times [2019-10-22 11:25:23,080 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:23,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8665612] [2019-10-22 11:25:23,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:23,080 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:23,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:25:23,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8665612] [2019-10-22 11:25:23,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:23,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:25:23,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374189635] [2019-10-22 11:25:23,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:25:23,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:25:23,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:23,150 INFO L87 Difference]: Start difference. First operand 1576 states and 1772 transitions. Second operand 4 states. [2019-10-22 11:25:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:23,643 INFO L93 Difference]: Finished difference Result 3674 states and 4184 transitions. [2019-10-22 11:25:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:25:23,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-22 11:25:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:23,653 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 11:25:23,653 INFO L226 Difference]: Without dead ends: 2231 [2019-10-22 11:25:23,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-10-22 11:25:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1576. [2019-10-22 11:25:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 11:25:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1745 transitions. [2019-10-22 11:25:23,686 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1745 transitions. Word has length 112 [2019-10-22 11:25:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:23,686 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1745 transitions. [2019-10-22 11:25:23,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:25:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1745 transitions. [2019-10-22 11:25:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-22 11:25:23,695 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:23,695 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:23,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1476523833, now seen corresponding path program 1 times [2019-10-22 11:25:23,696 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:23,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030271397] [2019-10-22 11:25:23,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:23,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:23,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-22 11:25:23,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030271397] [2019-10-22 11:25:23,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:25:23,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:25:23,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038438479] [2019-10-22 11:25:23,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:25:23,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:23,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:25:23,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:23,880 INFO L87 Difference]: Start difference. First operand 1576 states and 1745 transitions. Second operand 8 states. [2019-10-22 11:25:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:24,774 INFO L93 Difference]: Finished difference Result 3451 states and 3825 transitions. [2019-10-22 11:25:24,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:25:24,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-10-22 11:25:24,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:24,781 INFO L225 Difference]: With dead ends: 3451 [2019-10-22 11:25:24,781 INFO L226 Difference]: Without dead ends: 2008 [2019-10-22 11:25:24,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:25:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-10-22 11:25:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-10-22 11:25:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 11:25:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1877 transitions. [2019-10-22 11:25:24,814 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1877 transitions. Word has length 172 [2019-10-22 11:25:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:24,815 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1877 transitions. [2019-10-22 11:25:24,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:25:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1877 transitions. [2019-10-22 11:25:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-22 11:25:24,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:25:24,818 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:25:24,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:25:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:25:24,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1669631844, now seen corresponding path program 1 times [2019-10-22 11:25:24,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:25:24,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563956926] [2019-10-22 11:25:24,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:24,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:25:24,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:25:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-22 11:25:24,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563956926] [2019-10-22 11:25:24,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134896412] [2019-10-22 11:25:24,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/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:25:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:25:25,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:25:25,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:25:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-22 11:25:25,105 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:25:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-22 11:25:25,142 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-22 11:25:25,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2019-10-22 11:25:25,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712548757] [2019-10-22 11:25:25,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:25:25,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:25:25,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:25:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:25,143 INFO L87 Difference]: Start difference. First operand 1707 states and 1877 transitions. Second operand 3 states. [2019-10-22 11:25:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:25:25,480 INFO L93 Difference]: Finished difference Result 3541 states and 3907 transitions. [2019-10-22 11:25:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:25:25,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-22 11:25:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:25:25,481 INFO L225 Difference]: With dead ends: 3541 [2019-10-22 11:25:25,481 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:25:25,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:25:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:25:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:25:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:25:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:25:25,485 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 189 [2019-10-22 11:25:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:25:25,485 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:25:25,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:25:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:25:25,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:25:25,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:25:25,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:25:25,968 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-10-22 11:25:26,109 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-10-22 11:25:26,111 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 11:25:26,111 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 11:25:26,111 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 11:25:26,112 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 11:25:26,113 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 431) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 11:25:26,114 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,115 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 11:25:26,120 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a8~0 13))) (.cse4 (<= ~a17~0 0)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (= 1 ~a7~0) (and .cse0 .cse3 (= 5 ~a16~0)) (and (not (= ~a16~0 6)) .cse4) (and .cse0 .cse4) (and .cse1 .cse2 .cse3))) [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,121 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 11:25:26,122 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 11:25:26,123 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 11:25:26,126 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 11:25:26,127 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 11:25:26,128 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a8~0 13))) (.cse4 (<= ~a17~0 0)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse3 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (= 1 ~a7~0) (and .cse0 .cse3 (= 5 ~a16~0)) (and (not (= ~a16~0 6)) .cse4) (and .cse0 .cse4) (and .cse1 .cse2 .cse3))) [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 11:25:26,129 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 11:25:26,130 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,131 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,133 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,134 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 11:25:26,135 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 11:25:26,136 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 11:25:26,137 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 11:25:26,137 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 11:25:26,137 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 11:25:26,137 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 11:25:26,137 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 11:25:26,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:25:26 BoogieIcfgContainer [2019-10-22 11:25:26,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:25:26,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:25:26,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:25:26,162 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:25:26,162 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:25:19" (3/4) ... [2019-10-22 11:25:26,165 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:25:26,180 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 11:25:26,181 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:25:26,290 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c399db4c-d345-4317-af3f-eb0d4f926945/bin/utaipan/witness.graphml [2019-10-22 11:25:26,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:25:26,294 INFO L168 Benchmark]: Toolchain (without parser) took 9215.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 939.2 MB in the beginning and 879.5 MB in the end (delta: 59.6 MB). Peak memory consumption was 416.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,294 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:26,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:25:26,296 INFO L168 Benchmark]: Boogie Preprocessor took 74.96 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,296 INFO L168 Benchmark]: RCFGBuilder took 1177.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,296 INFO L168 Benchmark]: TraceAbstraction took 7144.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 901.9 MB in the end (delta: 114.4 MB). Peak memory consumption was 301.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,296 INFO L168 Benchmark]: Witness Printer took 131.22 ms. Allocated memory is still 1.4 GB. Free memory was 901.9 MB in the beginning and 879.5 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:25:26,298 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 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.96 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1177.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7144.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 901.9 MB in the end (delta: 114.4 MB). Peak memory consumption was 301.0 MB. Max. memory is 11.5 GB. * Witness Printer took 131.22 ms. Allocated memory is still 1.4 GB. Free memory was 901.9 MB in the beginning and 879.5 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 431]: 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: ((((((!(a8 == 13) && a17 == 1) && a21 == 1) || 1 == a7) || ((!(a8 == 13) && a20 == 1) && 5 == a16)) || (!(a16 == 6) && a17 <= 0)) || (!(a8 == 13) && a17 <= 0)) || ((a17 == 1 && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((!(a8 == 13) && a17 == 1) && a21 == 1) || 1 == a7) || ((!(a8 == 13) && a20 == 1) && 5 == a16)) || (!(a16 == 6) && a17 <= 0)) || (!(a8 == 13) && a17 <= 0)) || ((a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 589 SDtfs, 1933 SDslu, 96 SDs, 0 SdLazy, 4263 SolverSat, 722 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 386 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred 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.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1357 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 105 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2823 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2258 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1138 NumberOfCodeBlocks, 1138 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1317 ConstructedInterpolants, 0 QuantifiedInterpolants, 518269 SizeOfPredicates, 1 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 682/686 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...