./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label16.c -s /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/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 82fd55bcca66e80c1d71fa13be1c40df80f8da42 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:48:02,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:48:02,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:48:02,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:48:02,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:48:02,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:48:02,660 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:48:02,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:48:02,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:48:02,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:48:02,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:48:02,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:48:02,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:48:02,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:48:02,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:48:02,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:48:02,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:48:02,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:48:02,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:48:02,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:48:02,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:48:02,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:48:02,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:48:02,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:48:02,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:48:02,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:48:02,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:48:02,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:48:02,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:48:02,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:48:02,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:48:02,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:48:02,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:48:02,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:48:02,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:48:02,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:48:02,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:48:02,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:48:02,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:48:02,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:48:02,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:48:02,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:48:02,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:48:02,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:48:02,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:48:02,691 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:48:02,692 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:48:02,692 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:48:02,693 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:48:02,693 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:48:02,693 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:48:02,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:48:02,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:48:02,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:48:02,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:48:02,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:48:02,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:48:02,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:48:02,696 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/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/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 -> 82fd55bcca66e80c1d71fa13be1c40df80f8da42 [2019-12-07 21:48:02,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:48:02,804 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:48:02,807 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:48:02,808 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:48:02,809 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:48:02,809 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2019-12-07 21:48:02,849 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/data/e4b4e9846/506f08aedffc4cdc9fa2c6dcb69e7fe6/FLAG0f70eb564 [2019-12-07 21:48:03,202 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:48:03,203 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/sv-benchmarks/c/eca-rers2012/Problem01_label16.c [2019-12-07 21:48:03,212 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/data/e4b4e9846/506f08aedffc4cdc9fa2c6dcb69e7fe6/FLAG0f70eb564 [2019-12-07 21:48:03,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/data/e4b4e9846/506f08aedffc4cdc9fa2c6dcb69e7fe6 [2019-12-07 21:48:03,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:48:03,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:48:03,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:48:03,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:48:03,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:48:03,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761f314b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03, skipping insertion in model container [2019-12-07 21:48:03,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:48:03,274 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:48:03,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:48:03,558 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:48:03,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:48:03,641 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:48:03,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03 WrapperNode [2019-12-07 21:48:03,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:48:03,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:48:03,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:48:03,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:48:03,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:48:03,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:48:03,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:48:03,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:48:03,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... [2019-12-07 21:48:03,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:48:03,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:48:03,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:48:03,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:48:03,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/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-12-07 21:48:03,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:48:03,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:48:04,901 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:48:04,902 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 21:48:04,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:48:04 BoogieIcfgContainer [2019-12-07 21:48:04,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:48:04,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:48:04,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:48:04,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:48:04,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:48:03" (1/3) ... [2019-12-07 21:48:04,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd6692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:48:04, skipping insertion in model container [2019-12-07 21:48:04,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:48:03" (2/3) ... [2019-12-07 21:48:04,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd6692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:48:04, skipping insertion in model container [2019-12-07 21:48:04,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:48:04" (3/3) ... [2019-12-07 21:48:04,910 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label16.c [2019-12-07 21:48:04,919 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:48:04,925 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:48:04,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:48:04,950 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:48:04,950 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:48:04,950 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:48:04,950 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:48:04,950 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:48:04,950 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:48:04,951 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:48:04,951 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:48:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 21:48:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 21:48:04,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:04,968 INFO L410 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] [2019-12-07 21:48:04,968 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:04,972 INFO L82 PathProgramCache]: Analyzing trace with hash -839553754, now seen corresponding path program 1 times [2019-12-07 21:48:04,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:04,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041345695] [2019-12-07 21:48:04,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:48:05,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041345695] [2019-12-07 21:48:05,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:05,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:48:05,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951160717] [2019-12-07 21:48:05,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:05,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:05,234 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 21:48:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:05,620 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 21:48:05,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:48:05,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 21:48:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:05,631 INFO L225 Difference]: With dead ends: 297 [2019-12-07 21:48:05,631 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 21:48:05,634 INFO L630 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-12-07 21:48:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 21:48:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-12-07 21:48:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 21:48:05,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-12-07 21:48:05,673 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-12-07 21:48:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:05,674 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-12-07 21:48:05,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-12-07 21:48:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 21:48:05,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:05,677 INFO L410 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] [2019-12-07 21:48:05,677 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:05,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1061914503, now seen corresponding path program 1 times [2019-12-07 21:48:05,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:05,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610478705] [2019-12-07 21:48:05,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:48:05,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610478705] [2019-12-07 21:48:05,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:05,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:48:05,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818088679] [2019-12-07 21:48:05,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:05,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:05,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:05,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:05,712 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-12-07 21:48:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:06,053 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-12-07 21:48:06,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:48:06,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 21:48:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:06,057 INFO L225 Difference]: With dead ends: 573 [2019-12-07 21:48:06,057 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 21:48:06,058 INFO L630 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-12-07 21:48:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 21:48:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 21:48:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:48:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-12-07 21:48:06,078 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 77 [2019-12-07 21:48:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:06,078 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-12-07 21:48:06,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-12-07 21:48:06,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:48:06,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:06,081 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:06,082 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 128060392, now seen corresponding path program 1 times [2019-12-07 21:48:06,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:06,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028691279] [2019-12-07 21:48:06,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 21:48:06,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028691279] [2019-12-07 21:48:06,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:06,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:48:06,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951469615] [2019-12-07 21:48:06,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:48:06,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:48:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:48:06,127 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-12-07 21:48:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:06,351 INFO L93 Difference]: Finished difference Result 999 states and 1647 transitions. [2019-12-07 21:48:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:48:06,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 21:48:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:06,354 INFO L225 Difference]: With dead ends: 999 [2019-12-07 21:48:06,354 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 21:48:06,356 INFO L630 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-12-07 21:48:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 21:48:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 429. [2019-12-07 21:48:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 21:48:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-12-07 21:48:06,371 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 97 [2019-12-07 21:48:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:06,371 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-12-07 21:48:06,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:48:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-12-07 21:48:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 21:48:06,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:06,373 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 21:48:06,373 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1512521589, now seen corresponding path program 1 times [2019-12-07 21:48:06,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:06,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446151047] [2019-12-07 21:48:06,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 21:48:06,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446151047] [2019-12-07 21:48:06,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:06,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:48:06,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928882239] [2019-12-07 21:48:06,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:48:06,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:06,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:48:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:48:06,425 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-12-07 21:48:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:06,640 INFO L93 Difference]: Finished difference Result 1070 states and 1736 transitions. [2019-12-07 21:48:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:48:06,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 21:48:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:06,644 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 21:48:06,644 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 21:48:06,645 INFO L630 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-12-07 21:48:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 21:48:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 571. [2019-12-07 21:48:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 21:48:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 889 transitions. [2019-12-07 21:48:06,661 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 889 transitions. Word has length 133 [2019-12-07 21:48:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:06,661 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 889 transitions. [2019-12-07 21:48:06,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:48:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 889 transitions. [2019-12-07 21:48:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 21:48:06,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:06,664 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 21:48:06,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -495615713, now seen corresponding path program 1 times [2019-12-07 21:48:06,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:06,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239600989] [2019-12-07 21:48:06,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:48:06,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239600989] [2019-12-07 21:48:06,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:06,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:48:06,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681899706] [2019-12-07 21:48:06,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:06,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:06,756 INFO L87 Difference]: Start difference. First operand 571 states and 889 transitions. Second operand 4 states. [2019-12-07 21:48:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:07,049 INFO L93 Difference]: Finished difference Result 1232 states and 1886 transitions. [2019-12-07 21:48:07,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:48:07,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 21:48:07,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:07,052 INFO L225 Difference]: With dead ends: 1232 [2019-12-07 21:48:07,052 INFO L226 Difference]: Without dead ends: 662 [2019-12-07 21:48:07,053 INFO L630 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-12-07 21:48:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-07 21:48:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 642. [2019-12-07 21:48:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 21:48:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 966 transitions. [2019-12-07 21:48:07,065 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 966 transitions. Word has length 141 [2019-12-07 21:48:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:07,065 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 966 transitions. [2019-12-07 21:48:07,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 966 transitions. [2019-12-07 21:48:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 21:48:07,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:07,067 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-12-07 21:48:07,067 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash -23271977, now seen corresponding path program 1 times [2019-12-07 21:48:07,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:07,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056615672] [2019-12-07 21:48:07,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-07 21:48:07,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056615672] [2019-12-07 21:48:07,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:07,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:48:07,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147646857] [2019-12-07 21:48:07,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:07,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:07,125 INFO L87 Difference]: Start difference. First operand 642 states and 966 transitions. Second operand 4 states. [2019-12-07 21:48:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:07,496 INFO L93 Difference]: Finished difference Result 1567 states and 2365 transitions. [2019-12-07 21:48:07,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:48:07,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 21:48:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:07,501 INFO L225 Difference]: With dead ends: 1567 [2019-12-07 21:48:07,502 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 21:48:07,503 INFO L630 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-12-07 21:48:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 21:48:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-12-07 21:48:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-07 21:48:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-12-07 21:48:07,523 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-12-07 21:48:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:07,523 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-12-07 21:48:07,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-12-07 21:48:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 21:48:07,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:07,526 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:07,526 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash 129854170, now seen corresponding path program 1 times [2019-12-07 21:48:07,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:07,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469355025] [2019-12-07 21:48:07,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:48:07,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469355025] [2019-12-07 21:48:07,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:07,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:48:07,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54211660] [2019-12-07 21:48:07,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:48:07,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:48:07,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:48:07,658 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-12-07 21:48:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:08,184 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-12-07 21:48:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:48:08,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-12-07 21:48:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:08,189 INFO L225 Difference]: With dead ends: 1742 [2019-12-07 21:48:08,189 INFO L226 Difference]: Without dead ends: 1030 [2019-12-07 21:48:08,190 INFO L630 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-12-07 21:48:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-07 21:48:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-12-07 21:48:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 21:48:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-12-07 21:48:08,207 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-12-07 21:48:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:08,208 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-12-07 21:48:08,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:48:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-12-07 21:48:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 21:48:08,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:08,210 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:08,210 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:08,211 INFO L82 PathProgramCache]: Analyzing trace with hash 26459511, now seen corresponding path program 1 times [2019-12-07 21:48:08,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:08,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389417731] [2019-12-07 21:48:08,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 21:48:08,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389417731] [2019-12-07 21:48:08,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:08,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:48:08,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931690472] [2019-12-07 21:48:08,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:08,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:08,269 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-12-07 21:48:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:08,638 INFO L93 Difference]: Finished difference Result 2275 states and 3218 transitions. [2019-12-07 21:48:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:48:08,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 21:48:08,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:08,639 INFO L225 Difference]: With dead ends: 2275 [2019-12-07 21:48:08,639 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:48:08,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-12-07 21:48:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:48:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:48:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:48:08,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:48:08,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-12-07 21:48:08,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:08,642 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:48:08,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:08,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:48:08,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:48:08,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-12-07 21:48:08,940 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 21:48:08,941 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (= 13 ~a8~0) (and (not (= 1 ~a7~0)) .cse0))) [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 21:48:08,942 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (= 13 ~a8~0) (and (not (= 1 ~a7~0)) .cse0))) [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 21:48:08,943 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 21:48:08,944 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 566) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 21:48:08,945 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 21:48:08,946 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 21:48:08,946 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 21:48:08,946 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 21:48:08,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:48:08 BoogieIcfgContainer [2019-12-07 21:48:08,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:48:08,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:48:08,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:48:08,959 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:48:08,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:48:04" (3/4) ... [2019-12-07 21:48:08,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:48:08,975 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 21:48:08,976 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 21:48:08,978 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 21:48:08,979 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:48:09,060 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_60842fe9-29ef-488a-bbf3-a2946f37a440/bin/utaipan/witness.graphml [2019-12-07 21:48:09,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:48:09,062 INFO L168 Benchmark]: Toolchain (without parser) took 5837.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.9 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -78.9 MB). Peak memory consumption was 144.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:48:09,062 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:48:09,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:48:09,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:48:09,063 INFO L168 Benchmark]: Boogie Preprocessor took 49.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:48:09,063 INFO L168 Benchmark]: RCFGBuilder took 1143.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.9 MB in the end (delta: 220.3 MB). Peak memory consumption was 220.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:48:09,063 INFO L168 Benchmark]: TraceAbstraction took 4054.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 845.9 MB in the beginning and 1.0 GB in the end (delta: -191.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:48:09,063 INFO L168 Benchmark]: Witness Printer took 101.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:48:09,064 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 416.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1143.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 845.9 MB in the end (delta: 220.3 MB). Peak memory consumption was 220.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4054.15 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 845.9 MB in the beginning and 1.0 GB in the end (delta: -191.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 101.95 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: 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: ((!(a16 == 6) && a21 == 1) || 13 == a8) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((!(a16 == 6) && a21 == 1) || 13 == a8) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 378 SDtfs, 1229 SDslu, 75 SDs, 0 SdLazy, 2758 SolverSat, 896 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 621 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 41 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10430 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2146 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 985 NumberOfCodeBlocks, 985 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 977 ConstructedInterpolants, 0 QuantifiedInterpolants, 283430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 876/876 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...