./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/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 16d1e07abe3d8baa61b9a8d494202a7664f873bb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:34:36,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:34:36,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:34:36,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:34:36,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:34:36,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:34:36,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:34:36,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:34:36,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:34:36,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:34:36,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:34:36,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:34:36,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:34:36,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:34:36,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:34:36,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:34:36,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:34:36,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:34:36,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:34:36,201 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:34:36,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:34:36,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:34:36,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:34:36,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:34:36,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:34:36,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:34:36,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:34:36,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:34:36,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:34:36,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:34:36,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:34:36,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:34:36,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:34:36,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:34:36,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:34:36,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:34:36,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:34:36,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:34:36,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:34:36,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:34:36,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:34:36,215 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:34:36,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:34:36,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:34:36,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:34:36,228 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:34:36,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:34:36,229 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:34:36,229 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:34:36,229 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:34:36,229 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:34:36,229 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:34:36,230 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:34:36,230 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:34:36,230 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:34:36,230 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:34:36,230 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:34:36,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:34:36,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:34:36,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:34:36,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:34:36,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:34:36,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:34:36,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:34:36,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:34:36,232 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:34:36,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:34:36,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:34:36,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:34:36,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:34:36,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:34:36,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:34:36,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:34:36,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:34:36,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:34:36,234 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:34:36,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:34:36,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:34:36,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:34:36,235 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_e9e647f5-d397-400e-af0e-93ff1f6147d7/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 -> 16d1e07abe3d8baa61b9a8d494202a7664f873bb [2019-11-26 02:34:36,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:34:36,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:34:36,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:34:36,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:34:36,378 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:34:36,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-11-26 02:34:36,425 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/data/117cedb78/6b56109723cb4c9d92a82c58dc7494d8/FLAG1d5de7e26 [2019-11-26 02:34:36,920 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:34:36,920 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/sv-benchmarks/c/eca-rers2012/Problem01_label08.c [2019-11-26 02:34:36,930 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/data/117cedb78/6b56109723cb4c9d92a82c58dc7494d8/FLAG1d5de7e26 [2019-11-26 02:34:37,215 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/data/117cedb78/6b56109723cb4c9d92a82c58dc7494d8 [2019-11-26 02:34:37,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:34:37,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:34:37,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:34:37,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:34:37,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:34:37,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460c4b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37, skipping insertion in model container [2019-11-26 02:34:37,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:34:37,276 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:34:37,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:34:37,635 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:34:37,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:34:37,773 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:34:37,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37 WrapperNode [2019-11-26 02:34:37,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:34:37,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:34:37,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:34:37,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:34:37,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:34:37,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:34:37,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:34:37,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:34:37,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... [2019-11-26 02:34:37,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:34:37,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:34:37,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:34:37,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:34:37,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/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-11-26 02:34:37,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:34:37,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:34:39,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:34:39,785 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:34:39,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:39 BoogieIcfgContainer [2019-11-26 02:34:39,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:34:39,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:34:39,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:34:39,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:34:39,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:34:37" (1/3) ... [2019-11-26 02:34:39,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec16f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:34:39, skipping insertion in model container [2019-11-26 02:34:39,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:34:37" (2/3) ... [2019-11-26 02:34:39,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ec16f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:34:39, skipping insertion in model container [2019-11-26 02:34:39,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:39" (3/3) ... [2019-11-26 02:34:39,794 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label08.c [2019-11-26 02:34:39,803 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:34:39,811 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:34:39,821 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:34:39,853 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:34:39,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:34:39,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:34:39,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:34:39,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:34:39,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:34:39,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:34:39,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:34:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:34:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:34:39,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:39,884 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-11-26 02:34:39,885 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -839558106, now seen corresponding path program 1 times [2019-11-26 02:34:39,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:39,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900377822] [2019-11-26 02:34:39,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:34:40,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900377822] [2019-11-26 02:34:40,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:40,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:34:40,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665681495] [2019-11-26 02:34:40,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:40,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:40,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:40,298 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-26 02:34:40,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:40,752 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-26 02:34:40,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:40,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-26 02:34:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:40,765 INFO L225 Difference]: With dead ends: 224 [2019-11-26 02:34:40,765 INFO L226 Difference]: Without dead ends: 145 [2019-11-26 02:34:40,768 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-11-26 02:34:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-26 02:34:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-26 02:34:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:34:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-11-26 02:34:40,810 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-11-26 02:34:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:40,811 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-11-26 02:34:40,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-11-26 02:34:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-26 02:34:40,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:40,814 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:40,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash 262564574, now seen corresponding path program 1 times [2019-11-26 02:34:40,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:40,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861815197] [2019-11-26 02:34:40,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:34:40,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861815197] [2019-11-26 02:34:40,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:40,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:40,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882487307] [2019-11-26 02:34:40,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:40,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:40,941 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 4 states. [2019-11-26 02:34:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:41,556 INFO L93 Difference]: Finished difference Result 573 states and 1007 transitions. [2019-11-26 02:34:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:41,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-26 02:34:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:41,561 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:34:41,561 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:34:41,563 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-11-26 02:34:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:34:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 287. [2019-11-26 02:34:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-26 02:34:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-11-26 02:34:41,605 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-11-26 02:34:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:41,608 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-11-26 02:34:41,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-11-26 02:34:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 02:34:41,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:41,615 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:41,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 406857172, now seen corresponding path program 1 times [2019-11-26 02:34:41,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:41,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930185364] [2019-11-26 02:34:41,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:34:41,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930185364] [2019-11-26 02:34:41,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:41,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:34:41,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371195786] [2019-11-26 02:34:41,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:41,727 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-11-26 02:34:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:42,108 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-11-26 02:34:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:42,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-26 02:34:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:42,111 INFO L225 Difference]: With dead ends: 715 [2019-11-26 02:34:42,112 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:34:42,113 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-11-26 02:34:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:34:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-26 02:34:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-26 02:34:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-11-26 02:34:42,130 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 105 [2019-11-26 02:34:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:42,130 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-11-26 02:34:42,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-11-26 02:34:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:34:42,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:42,134 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:34:42,134 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:42,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash 175522078, now seen corresponding path program 1 times [2019-11-26 02:34:42,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:42,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243827180] [2019-11-26 02:34:42,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:34:42,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243827180] [2019-11-26 02:34:42,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:42,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:34:42,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909190577] [2019-11-26 02:34:42,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:34:42,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:34:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:34:42,278 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-11-26 02:34:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:42,785 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-11-26 02:34:42,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:42,786 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-26 02:34:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:42,789 INFO L225 Difference]: With dead ends: 788 [2019-11-26 02:34:42,789 INFO L226 Difference]: Without dead ends: 431 [2019-11-26 02:34:42,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:34:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-26 02:34:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-11-26 02:34:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:34:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-11-26 02:34:42,811 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 109 [2019-11-26 02:34:42,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:42,812 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-11-26 02:34:42,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:34:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-11-26 02:34:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:34:42,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:42,814 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:42,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 94275030, now seen corresponding path program 1 times [2019-11-26 02:34:42,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:42,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830541318] [2019-11-26 02:34:42,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-26 02:34:42,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830541318] [2019-11-26 02:34:42,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:42,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:34:42,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680873514] [2019-11-26 02:34:42,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:42,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:42,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:42,885 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 3 states. [2019-11-26 02:34:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:43,221 INFO L93 Difference]: Finished difference Result 928 states and 1464 transitions. [2019-11-26 02:34:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:43,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-26 02:34:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:43,225 INFO L225 Difference]: With dead ends: 928 [2019-11-26 02:34:43,225 INFO L226 Difference]: Without dead ends: 571 [2019-11-26 02:34:43,226 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-11-26 02:34:43,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-26 02:34:43,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-26 02:34:43,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:34:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 842 transitions. [2019-11-26 02:34:43,254 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 842 transitions. Word has length 113 [2019-11-26 02:34:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:43,255 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 842 transitions. [2019-11-26 02:34:43,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 842 transitions. [2019-11-26 02:34:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-26 02:34:43,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:43,257 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:43,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:43,257 INFO L82 PathProgramCache]: Analyzing trace with hash 927110326, now seen corresponding path program 1 times [2019-11-26 02:34:43,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:43,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338315117] [2019-11-26 02:34:43,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-26 02:34:43,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338315117] [2019-11-26 02:34:43,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:43,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:34:43,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208017315] [2019-11-26 02:34:43,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:43,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:43,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:43,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:43,342 INFO L87 Difference]: Start difference. First operand 571 states and 842 transitions. Second operand 4 states. [2019-11-26 02:34:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:43,951 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-11-26 02:34:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:43,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-26 02:34:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:43,959 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:34:43,959 INFO L226 Difference]: Without dead ends: 1210 [2019-11-26 02:34:43,960 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-11-26 02:34:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-11-26 02:34:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 855. [2019-11-26 02:34:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:34:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1222 transitions. [2019-11-26 02:34:43,992 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1222 transitions. Word has length 122 [2019-11-26 02:34:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:43,992 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1222 transitions. [2019-11-26 02:34:43,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1222 transitions. [2019-11-26 02:34:43,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-26 02:34:43,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:43,995 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-26 02:34:43,996 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:43,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:43,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1551429574, now seen corresponding path program 1 times [2019-11-26 02:34:43,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:43,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477329929] [2019-11-26 02:34:44,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-26 02:34:44,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477329929] [2019-11-26 02:34:44,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:44,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:44,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815317245] [2019-11-26 02:34:44,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:44,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:44,104 INFO L87 Difference]: Start difference. First operand 855 states and 1222 transitions. Second operand 4 states. [2019-11-26 02:34:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:44,590 INFO L93 Difference]: Finished difference Result 1638 states and 2366 transitions. [2019-11-26 02:34:44,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:44,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-26 02:34:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:44,595 INFO L225 Difference]: With dead ends: 1638 [2019-11-26 02:34:44,595 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:34:44,596 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-11-26 02:34:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:34:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-26 02:34:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:34:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1216 transitions. [2019-11-26 02:34:44,616 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1216 transitions. Word has length 146 [2019-11-26 02:34:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:44,616 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1216 transitions. [2019-11-26 02:34:44,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1216 transitions. [2019-11-26 02:34:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-26 02:34:44,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:44,619 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:44,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1130225127, now seen corresponding path program 1 times [2019-11-26 02:34:44,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:44,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995941269] [2019-11-26 02:34:44,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-26 02:34:44,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995941269] [2019-11-26 02:34:44,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:44,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:34:44,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998589867] [2019-11-26 02:34:44,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:34:44,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:44,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:34:44,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:34:44,830 INFO L87 Difference]: Start difference. First operand 855 states and 1216 transitions. Second operand 8 states. [2019-11-26 02:34:45,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:45,597 INFO L93 Difference]: Finished difference Result 1890 states and 2678 transitions. [2019-11-26 02:34:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:34:45,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-11-26 02:34:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:45,604 INFO L225 Difference]: With dead ends: 1890 [2019-11-26 02:34:45,604 INFO L226 Difference]: Without dead ends: 1107 [2019-11-26 02:34:45,607 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-11-26 02:34:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-26 02:34:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-11-26 02:34:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:34:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1375 transitions. [2019-11-26 02:34:45,630 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1375 transitions. Word has length 158 [2019-11-26 02:34:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:45,631 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1375 transitions. [2019-11-26 02:34:45,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:34:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1375 transitions. [2019-11-26 02:34:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-26 02:34:45,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:45,634 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:45,635 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash -397130838, now seen corresponding path program 1 times [2019-11-26 02:34:45,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:45,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109798362] [2019-11-26 02:34:45,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-26 02:34:45,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109798362] [2019-11-26 02:34:45,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:45,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:34:45,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035776492] [2019-11-26 02:34:45,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:34:45,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:34:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:45,729 INFO L87 Difference]: Start difference. First operand 997 states and 1375 transitions. Second operand 4 states. [2019-11-26 02:34:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:46,166 INFO L93 Difference]: Finished difference Result 2348 states and 3224 transitions. [2019-11-26 02:34:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:34:46,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-26 02:34:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:46,171 INFO L225 Difference]: With dead ends: 2348 [2019-11-26 02:34:46,171 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:34:46,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:34:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:34:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-26 02:34:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:34:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1057 transitions. [2019-11-26 02:34:46,193 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1057 transitions. Word has length 161 [2019-11-26 02:34:46,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:46,193 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1057 transitions. [2019-11-26 02:34:46,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:34:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1057 transitions. [2019-11-26 02:34:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-26 02:34:46,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:34:46,196 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:34:46,196 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:34:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:34:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1210199784, now seen corresponding path program 1 times [2019-11-26 02:34:46,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:34:46,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739137266] [2019-11-26 02:34:46,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:34:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:34:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-26 02:34:46,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739137266] [2019-11-26 02:34:46,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:34:46,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:34:46,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339143391] [2019-11-26 02:34:46,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:34:46,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:34:46,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:34:46,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:46,322 INFO L87 Difference]: Start difference. First operand 926 states and 1057 transitions. Second operand 3 states. [2019-11-26 02:34:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:34:46,571 INFO L93 Difference]: Finished difference Result 1139 states and 1309 transitions. [2019-11-26 02:34:46,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:34:46,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-26 02:34:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:34:46,572 INFO L225 Difference]: With dead ends: 1139 [2019-11-26 02:34:46,572 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:34:46,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:34:46,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:34:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:34:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:34:46,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:34:46,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-11-26 02:34:46,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:34:46,574 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:34:46,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:34:46,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:34:46,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:34:46,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:34:46,799 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:34:46,883 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:34:46,884 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:34:46,885 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:34:46,886 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 13 ~a8~0))) (let ((.cse4 (not .cse0)) (.cse5 (not (= ~a16~0 6))) (.cse2 (not (= 1 ~a7~0))) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a20~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse0 .cse5 (= ~a17~0 1)) (and .cse5 .cse2 .cse3) (and (not (= 15 ~a8~0)) .cse3 .cse1)))) [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:34:46,887 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:34:46,888 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:34:46,889 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:34:46,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:34:46 BoogieIcfgContainer [2019-11-26 02:34:46,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:34:46,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:34:46,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:34:46,906 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:34:46,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:34:39" (3/4) ... [2019-11-26 02:34:46,909 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:34:46,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:34:46,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-11-26 02:34:46,936 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-26 02:34:46,942 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:34:47,110 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9e647f5-d397-400e-af0e-93ff1f6147d7/bin/utaipan/witness.graphml [2019-11-26 02:34:47,110 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:34:47,112 INFO L168 Benchmark]: Toolchain (without parser) took 9892.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 944.7 MB in the beginning and 898.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 320.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,112 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:34:47,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,114 INFO L168 Benchmark]: Boogie Preprocessor took 67.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,114 INFO L168 Benchmark]: RCFGBuilder took 1870.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.5 MB in the end (delta: 217.8 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,114 INFO L168 Benchmark]: TraceAbstraction took 7118.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 881.5 MB in the beginning and 926.8 MB in the end (delta: -45.2 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,115 INFO L168 Benchmark]: Witness Printer took 204.69 ms. Allocated memory is still 1.3 GB. Free memory was 926.8 MB in the beginning and 898.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:34:47,117 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -166.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1870.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.5 MB in the end (delta: 217.8 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7118.22 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.0 MB). Free memory was 881.5 MB in the beginning and 926.8 MB in the end (delta: -45.2 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. * Witness Printer took 204.69 ms. Allocated memory is still 1.3 GB. Free memory was 926.8 MB in the beginning and 898.7 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 515]: 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: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((13 == a8 && a20 == 1) || ((!(1 == a7) && a21 == 1) && !(13 == a8))) || ((!(a16 == 6) && a21 == 1) && !(13 == a8))) || ((13 == a8 && !(a16 == 6)) && a17 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.0s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 430 SDtfs, 1287 SDslu, 76 SDs, 0 SdLazy, 3199 SolverSat, 876 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred 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.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 822 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 47 NumberOfFragments, 133 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5286 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 178 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1225 ConstructedInterpolants, 0 QuantifiedInterpolants, 394722 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 761/761 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...