./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label04.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_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/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 3774d82389353be2170e26cc4e53c0d06e3cb94d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 20:15:44,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:15:44,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:15:44,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:15:44,827 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:15:44,828 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:15:44,829 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:15:44,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:15:44,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:15:44,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:15:44,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:15:44,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:15:44,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:15:44,837 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:15:44,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:15:44,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:15:44,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:15:44,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:15:44,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:15:44,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:15:44,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:15:44,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:15:44,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:15:44,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:15:44,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:15:44,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:15:44,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:15:44,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:15:44,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:15:44,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:15:44,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:15:44,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:15:44,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:15:44,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:15:44,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:15:44,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:15:44,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:15:44,855 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:15:44,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:15:44,856 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:15:44,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:15:44,858 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:15:44,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:15:44,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:15:44,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:15:44,868 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:15:44,868 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:15:44,868 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:15:44,868 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:15:44,868 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:15:44,869 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:15:44,869 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:15:44,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:15:44,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:15:44,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:15:44,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:15:44,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:15:44,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:15:44,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:15:44,873 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:15:44,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:15:44,873 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_445e51af-e93e-49bf-bfae-0e26ad6bc671/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 -> 3774d82389353be2170e26cc4e53c0d06e3cb94d [2019-12-07 20:15:44,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:15:44,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:15:44,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:15:44,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:15:44,990 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:15:44,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2019-12-07 20:15:45,030 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/data/338dd2b6e/b665b00f2e2a4a09805f0243fc227a35/FLAG89ee545e2 [2019-12-07 20:15:45,475 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:15:45,476 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/sv-benchmarks/c/eca-rers2012/Problem01_label04.c [2019-12-07 20:15:45,485 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/data/338dd2b6e/b665b00f2e2a4a09805f0243fc227a35/FLAG89ee545e2 [2019-12-07 20:15:45,497 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/data/338dd2b6e/b665b00f2e2a4a09805f0243fc227a35 [2019-12-07 20:15:45,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:15:45,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:15:45,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:15:45,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:15:45,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:15:45,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45, skipping insertion in model container [2019-12-07 20:15:45,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:15:45,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:15:45,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:15:45,824 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:15:45,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:15:45,908 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:15:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45 WrapperNode [2019-12-07 20:15:45,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:15:45,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:15:45,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:15:45,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:15:45,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:15:45,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:15:45,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:15:45,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:15:45,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:45,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:46,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... [2019-12-07 20:15:46,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:15:46,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:15:46,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:15:46,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:15:46,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/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 20:15:46,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:15:46,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:15:47,086 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:15:47,086 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 20:15:47,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:15:47 BoogieIcfgContainer [2019-12-07 20:15:47,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:15:47,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:15:47,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:15:47,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:15:47,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:15:45" (1/3) ... [2019-12-07 20:15:47,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:15:47, skipping insertion in model container [2019-12-07 20:15:47,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:15:45" (2/3) ... [2019-12-07 20:15:47,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:15:47, skipping insertion in model container [2019-12-07 20:15:47,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:15:47" (3/3) ... [2019-12-07 20:15:47,093 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c [2019-12-07 20:15:47,100 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:15:47,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:15:47,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:15:47,130 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:15:47,130 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:15:47,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:15:47,131 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:15:47,131 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:15:47,131 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:15:47,131 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:15:47,131 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:15:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 20:15:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:15:47,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:47,150 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 20:15:47,150 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1323243551, now seen corresponding path program 1 times [2019-12-07 20:15:47,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:47,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:15:47,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:47,391 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 20:15:47,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:15:47,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:47,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:15:47,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 20:15:47,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:15:47,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:15:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:15:47,407 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 20:15:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:47,799 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 20:15:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:15:47,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 20:15:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:47,810 INFO L225 Difference]: With dead ends: 297 [2019-12-07 20:15:47,811 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 20:15:47,814 INFO L630 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-12-07 20:15:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 20:15:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-12-07 20:15:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-12-07 20:15:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-12-07 20:15:47,854 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-12-07 20:15:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:47,855 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-12-07 20:15:47,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-12-07 20:15:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 20:15:47,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:47,858 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 20:15:47,858 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:47,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:47,858 INFO L82 PathProgramCache]: Analyzing trace with hash 585774169, now seen corresponding path program 1 times [2019-12-07 20:15:47,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:47,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:15:47,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:15:47,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:15:47,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:47,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:15:47,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022470641] [2019-12-07 20:15:47,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:15:47,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:47,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:15:47,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:15:47,897 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-12-07 20:15:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:48,178 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-12-07 20:15:48,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:48,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 20:15:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:48,182 INFO L225 Difference]: With dead ends: 644 [2019-12-07 20:15:48,183 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:15:48,185 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 20:15:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:15:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 20:15:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 20:15:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-12-07 20:15:48,210 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-12-07 20:15:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:48,210 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-12-07 20:15:48,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-12-07 20:15:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 20:15:48,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:48,214 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 20:15:48,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:48,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash 928581475, now seen corresponding path program 1 times [2019-12-07 20:15:48,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037147433] [2019-12-07 20:15:48,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:48,267 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 20:15:48,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037147433] [2019-12-07 20:15:48,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:48,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:15:48,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377765553] [2019-12-07 20:15:48,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:15:48,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:15:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:48,269 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-12-07 20:15:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:48,496 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-12-07 20:15:48,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:48,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 20:15:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:48,499 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 20:15:48,500 INFO L226 Difference]: Without dead ends: 642 [2019-12-07 20:15:48,501 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 20:15:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-07 20:15:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-12-07 20:15:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-07 20:15:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-12-07 20:15:48,514 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-12-07 20:15:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:48,514 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-12-07 20:15:48,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:15:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-12-07 20:15:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 20:15:48,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:48,516 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 20:15:48,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1330802810, now seen corresponding path program 1 times [2019-12-07 20:15:48,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222569340] [2019-12-07 20:15:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:48,568 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 20:15:48,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222569340] [2019-12-07 20:15:48,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:48,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:15:48,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070644890] [2019-12-07 20:15:48,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:15:48,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:15:48,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:48,570 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-12-07 20:15:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:48,780 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-12-07 20:15:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:48,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-12-07 20:15:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:48,784 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 20:15:48,785 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 20:15:48,786 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 20:15:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 20:15:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-12-07 20:15:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 20:15:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2019-12-07 20:15:48,803 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 133 [2019-12-07 20:15:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:48,803 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2019-12-07 20:15:48,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:15:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2019-12-07 20:15:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 20:15:48,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:48,806 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, 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 20:15:48,806 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash -211733482, now seen corresponding path program 1 times [2019-12-07 20:15:48,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:48,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670282134] [2019-12-07 20:15:48,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-12-07 20:15:48,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670282134] [2019-12-07 20:15:48,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:48,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:15:48,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421029563] [2019-12-07 20:15:48,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:15:48,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:15:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:48,870 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 3 states. [2019-12-07 20:15:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:49,109 INFO L93 Difference]: Finished difference Result 1709 states and 2563 transitions. [2019-12-07 20:15:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:49,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-12-07 20:15:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:49,113 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 20:15:49,113 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 20:15:49,114 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 20:15:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 20:15:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-12-07 20:15:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 20:15:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-12-07 20:15:49,130 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-12-07 20:15:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:49,131 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-12-07 20:15:49,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:15:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-12-07 20:15:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 20:15:49,132 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:49,133 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-12-07 20:15:49,133 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1004826717, now seen corresponding path program 1 times [2019-12-07 20:15:49,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:49,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001339124] [2019-12-07 20:15:49,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 20:15:49,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001339124] [2019-12-07 20:15:49,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:49,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:15:49,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005001374] [2019-12-07 20:15:49,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:15:49,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:49,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:15:49,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:15:49,185 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-12-07 20:15:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:49,418 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-12-07 20:15:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:15:49,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-12-07 20:15:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:49,422 INFO L225 Difference]: With dead ends: 1851 [2019-12-07 20:15:49,422 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 20:15:49,423 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 20:15:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 20:15:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-12-07 20:15:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:15:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-12-07 20:15:49,442 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-12-07 20:15:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:49,443 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-12-07 20:15:49,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:15:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-12-07 20:15:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 20:15:49,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:49,445 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 20:15:49,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1683953003, now seen corresponding path program 1 times [2019-12-07 20:15:49,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:49,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050658914] [2019-12-07 20:15:49,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:49,588 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 20:15:49,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050658914] [2019-12-07 20:15:49,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:49,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:15:49,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065086496] [2019-12-07 20:15:49,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:15:49,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:49,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:15:49,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:15:49,590 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-12-07 20:15:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:50,090 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-12-07 20:15:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:15:50,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-12-07 20:15:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:50,094 INFO L225 Difference]: With dead ends: 2100 [2019-12-07 20:15:50,094 INFO L226 Difference]: Without dead ends: 1104 [2019-12-07 20:15:50,095 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 20:15:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-07 20:15:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-12-07 20:15:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:15:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-12-07 20:15:50,112 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-12-07 20:15:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:50,112 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-12-07 20:15:50,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:15:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-12-07 20:15:50,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 20:15:50,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:50,115 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 20:15:50,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash -114232187, now seen corresponding path program 1 times [2019-12-07 20:15:50,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:50,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897929456] [2019-12-07 20:15:50,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-12-07 20:15:50,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897929456] [2019-12-07 20:15:50,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:50,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:15:50,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413501241] [2019-12-07 20:15:50,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:15:50,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:50,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:15:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:15:50,197 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-12-07 20:15:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:50,524 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-12-07 20:15:50,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:15:50,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 20:15:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:50,530 INFO L225 Difference]: With dead ends: 2135 [2019-12-07 20:15:50,530 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 20:15:50,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 20:15:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 20:15:50,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-12-07 20:15:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 20:15:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-12-07 20:15:50,554 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-12-07 20:15:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:50,554 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-12-07 20:15:50,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-12-07 20:15:50,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 20:15:50,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:50,558 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 20:15:50,559 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:50,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1171743545, now seen corresponding path program 1 times [2019-12-07 20:15:50,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:50,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959817292] [2019-12-07 20:15:50,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 20:15:50,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959817292] [2019-12-07 20:15:50,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:50,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:15:50,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317196923] [2019-12-07 20:15:50,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:15:50,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:50,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:15:50,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:15:50,638 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-12-07 20:15:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:50,921 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-12-07 20:15:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:15:50,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-12-07 20:15:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:50,926 INFO L225 Difference]: With dead ends: 2419 [2019-12-07 20:15:50,926 INFO L226 Difference]: Without dead ends: 1352 [2019-12-07 20:15:50,927 INFO L630 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-12-07 20:15:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-12-07 20:15:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-12-07 20:15:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-12-07 20:15:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-12-07 20:15:50,943 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-12-07 20:15:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:50,944 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-12-07 20:15:50,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:15:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-12-07 20:15:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 20:15:50,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:50,947 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:15:50,947 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash 39383556, now seen corresponding path program 1 times [2019-12-07 20:15:50,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:50,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139049141] [2019-12-07 20:15:50,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 20:15:51,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139049141] [2019-12-07 20:15:51,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:51,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:15:51,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120375258] [2019-12-07 20:15:51,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:15:51,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:51,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:15:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:15:51,074 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-12-07 20:15:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:51,434 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-12-07 20:15:51,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:15:51,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-12-07 20:15:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:51,439 INFO L225 Difference]: With dead ends: 2244 [2019-12-07 20:15:51,439 INFO L226 Difference]: Without dead ends: 1177 [2019-12-07 20:15:51,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:15:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-12-07 20:15:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-12-07 20:15:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:15:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-12-07 20:15:51,460 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-12-07 20:15:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:51,461 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-12-07 20:15:51,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:15:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-12-07 20:15:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-12-07 20:15:51,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:15:51,465 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-12-07 20:15:51,465 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:15:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:15:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1839443035, now seen corresponding path program 1 times [2019-12-07 20:15:51,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:15:51,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113791541] [2019-12-07 20:15:51,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:15:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:15:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 20:15:52,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113791541] [2019-12-07 20:15:52,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:15:52,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 20:15:52,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363335151] [2019-12-07 20:15:52,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 20:15:52,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:15:52,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 20:15:52,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-12-07 20:15:52,151 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-12-07 20:15:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:15:53,010 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-12-07 20:15:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 20:15:53,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-12-07 20:15:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:15:53,011 INFO L225 Difference]: With dead ends: 2252 [2019-12-07 20:15:53,011 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:15:53,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:15:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:15:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:15:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:15:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:15:53,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-12-07 20:15:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:15:53,013 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:15:53,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 20:15:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:15:53,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:15:53,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:15:53,485 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-12-07 20:15:53,799 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 51 [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 20:15:53,801 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 20:15:53,802 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse4 (= 13 ~a8~0)) (.cse7 (<= ~a17~0 0)) (.cse10 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse6 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse7 .cse8 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse10 .cse0 .cse7) (and .cse10 .cse0 .cse1 (not .cse6)) (and .cse5 .cse11 .cse6 .cse0 .cse1) (and .cse6 .cse0 .cse1 .cse8) (and .cse11 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 20:15:53,803 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 20:15:53,803 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 20:15:53,804 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse4 (= 13 ~a8~0)) (.cse7 (<= ~a17~0 0)) (.cse10 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse6 (= ~a17~0 1)) (.cse8 (= ~a20~0 1)) (.cse11 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse2 .cse3 .cse4 .cse0 .cse7 .cse8 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse10 .cse0 .cse7) (and .cse10 .cse0 .cse1 (not .cse6)) (and .cse5 .cse11 .cse6 .cse0 .cse1) (and .cse6 .cse0 .cse1 .cse8) (and .cse11 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 20:15:53,805 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 20:15:53,806 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 464) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 20:15:53,807 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-12-07 20:15:53,808 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 20:15:53,808 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 20:15:53,808 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 20:15:53,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:15:53 BoogieIcfgContainer [2019-12-07 20:15:53,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:15:53,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:15:53,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:15:53,829 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:15:53,829 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:15:47" (3/4) ... [2019-12-07 20:15:53,832 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:15:53,851 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 20:15:53,853 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 20:15:53,854 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-07 20:15:53,947 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_445e51af-e93e-49bf-bfae-0e26ad6bc671/bin/utaipan/witness.graphml [2019-12-07 20:15:53,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:15:53,948 INFO L168 Benchmark]: Toolchain (without parser) took 8447.12 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 336.6 MB). Free memory was 938.1 MB in the beginning and 999.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 275.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,948 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:53,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -105.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,949 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:15:53,949 INFO L168 Benchmark]: RCFGBuilder took 1078.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 818.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,950 INFO L168 Benchmark]: TraceAbstraction took 6740.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 266.3 MB). Free memory was 818.3 MB in the beginning and 1.0 GB in the end (delta: -196.4 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,950 INFO L168 Benchmark]: Witness Printer took 118.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-12-07 20:15:53,952 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.3 MB). Free memory was 938.1 MB in the beginning and 1.0 GB in the end (delta: -105.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1078.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 818.3 MB in the end (delta: 214.2 MB). Peak memory consumption was 214.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6740.18 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 266.3 MB). Free memory was 818.3 MB in the beginning and 1.0 GB in the end (delta: -196.4 MB). Peak memory consumption was 69.9 MB. Max. memory is 11.5 GB. * Witness Printer took 118.22 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 464]: 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: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.8s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 598 SDtfs, 1468 SDslu, 108 SDs, 0 SdLazy, 4618 SolverSat, 923 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred in iteration=8, 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, 11 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 299 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15492 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4924 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2252/2252 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...