./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.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_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/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 e521cfa02db8c2eac8727300620f5ffec2ecc0c7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:49:22,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:49:22,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:49:22,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:49:22,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:49:22,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:49:22,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:49:22,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:49:22,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:49:22,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:49:22,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:49:22,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:49:22,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:49:22,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:49:22,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:49:22,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:49:22,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:49:22,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:49:22,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:49:22,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:49:22,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:49:22,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:49:22,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:49:22,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:49:22,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:49:22,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:49:22,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:49:22,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:49:22,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:49:22,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:49:22,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:49:22,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:49:22,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:49:22,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:49:22,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:49:22,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:49:22,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:49:22,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:49:22,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:49:22,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:49:22,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:49:22,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:49:22,208 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:49:22,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:49:22,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:49:22,209 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:49:22,209 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:49:22,210 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:49:22,210 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:49:22,210 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:49:22,210 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:49:22,210 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:49:22,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:49:22,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:49:22,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:49:22,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:49:22,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:49:22,213 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:49:22,213 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_4e007f1e-d467-48da-90ed-c40773c7d23c/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 -> e521cfa02db8c2eac8727300620f5ffec2ecc0c7 [2019-12-07 14:49:22,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:49:22,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:49:22,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:49:22,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:49:22,327 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:49:22,327 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-12-07 14:49:22,365 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/data/343f70db3/61554b2acdf14c13bef32521cd877ce6/FLAGf4480c24c [2019-12-07 14:49:22,714 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:49:22,715 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-12-07 14:49:22,722 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/data/343f70db3/61554b2acdf14c13bef32521cd877ce6/FLAGf4480c24c [2019-12-07 14:49:23,114 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/data/343f70db3/61554b2acdf14c13bef32521cd877ce6 [2019-12-07 14:49:23,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:49:23,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:49:23,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:49:23,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:49:23,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:49:23,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354778c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23, skipping insertion in model container [2019-12-07 14:49:23,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:49:23,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:49:23,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:49:23,398 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:49:23,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:49:23,460 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:49:23,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23 WrapperNode [2019-12-07 14:49:23,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:49:23,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:49:23,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:49:23,461 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:49:23,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:49:23,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:49:23,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:49:23,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:49:23,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... [2019-12-07 14:49:23,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:49:23,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:49:23,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:49:23,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:49:23,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/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 14:49:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:49:23,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:49:24,707 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:49:24,707 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:49:24,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:24 BoogieIcfgContainer [2019-12-07 14:49:24,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:49:24,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:49:24,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:49:24,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:49:24,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:49:23" (1/3) ... [2019-12-07 14:49:24,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fffda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:49:24, skipping insertion in model container [2019-12-07 14:49:24,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:49:23" (2/3) ... [2019-12-07 14:49:24,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fffda6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:49:24, skipping insertion in model container [2019-12-07 14:49:24,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:24" (3/3) ... [2019-12-07 14:49:24,713 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label00.c [2019-12-07 14:49:24,720 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:49:24,726 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:49:24,734 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:49:24,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:49:24,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:49:24,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:49:24,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:49:24,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:49:24,761 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:49:24,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:49:24,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:49:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 14:49:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:49:24,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:24,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:24,783 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 925957135, now seen corresponding path program 1 times [2019-12-07 14:49:24,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:24,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345037631] [2019-12-07 14:49:24,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:25,006 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 14:49:25,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345037631] [2019-12-07 14:49:25,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:25,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:25,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170051655] [2019-12-07 14:49:25,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:25,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:25,022 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 14:49:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:25,497 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 14:49:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:25,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:49:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:25,508 INFO L225 Difference]: With dead ends: 333 [2019-12-07 14:49:25,508 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 14:49:25,510 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 14:49:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 14:49:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2019-12-07 14:49:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 14:49:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 298 transitions. [2019-12-07 14:49:25,545 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 298 transitions. Word has length 80 [2019-12-07 14:49:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:25,546 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 298 transitions. [2019-12-07 14:49:25,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 298 transitions. [2019-12-07 14:49:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:49:25,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:25,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:25,549 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1028677892, now seen corresponding path program 1 times [2019-12-07 14:49:25,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:25,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916267947] [2019-12-07 14:49:25,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916267947] [2019-12-07 14:49:25,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:25,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974802389] [2019-12-07 14:49:25,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:25,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:25,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:25,614 INFO L87 Difference]: Start difference. First operand 163 states and 298 transitions. Second operand 3 states. [2019-12-07 14:49:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:25,832 INFO L93 Difference]: Finished difference Result 485 states and 891 transitions. [2019-12-07 14:49:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:25,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-07 14:49:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:25,836 INFO L225 Difference]: With dead ends: 485 [2019-12-07 14:49:25,836 INFO L226 Difference]: Without dead ends: 323 [2019-12-07 14:49:25,838 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-12-07 14:49:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-07 14:49:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-12-07 14:49:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-07 14:49:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 548 transitions. [2019-12-07 14:49:25,858 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 548 transitions. Word has length 84 [2019-12-07 14:49:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:25,858 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 548 transitions. [2019-12-07 14:49:25,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 548 transitions. [2019-12-07 14:49:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:49:25,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:25,862 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:25,862 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash -833102701, now seen corresponding path program 1 times [2019-12-07 14:49:25,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:25,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665510023] [2019-12-07 14:49:25,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:25,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665510023] [2019-12-07 14:49:25,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:25,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:49:25,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430122257] [2019-12-07 14:49:25,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:25,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:25,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:25,896 INFO L87 Difference]: Start difference. First operand 323 states and 548 transitions. Second operand 3 states. [2019-12-07 14:49:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:26,173 INFO L93 Difference]: Finished difference Result 965 states and 1641 transitions. [2019-12-07 14:49:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:26,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-12-07 14:49:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:26,177 INFO L225 Difference]: With dead ends: 965 [2019-12-07 14:49:26,177 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 14:49:26,179 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 14:49:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 14:49:26,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-12-07 14:49:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 14:49:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1004 transitions. [2019-12-07 14:49:26,203 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1004 transitions. Word has length 90 [2019-12-07 14:49:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:26,203 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 1004 transitions. [2019-12-07 14:49:26,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1004 transitions. [2019-12-07 14:49:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:49:26,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:26,205 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:26,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 221757614, now seen corresponding path program 1 times [2019-12-07 14:49:26,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:26,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162874559] [2019-12-07 14:49:26,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:26,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162874559] [2019-12-07 14:49:26,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:26,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:26,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337650139] [2019-12-07 14:49:26,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:26,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:26,252 INFO L87 Difference]: Start difference. First operand 643 states and 1004 transitions. Second operand 4 states. [2019-12-07 14:49:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:26,489 INFO L93 Difference]: Finished difference Result 1285 states and 2007 transitions. [2019-12-07 14:49:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:26,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:49:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:26,492 INFO L225 Difference]: With dead ends: 1285 [2019-12-07 14:49:26,492 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 14:49:26,492 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 14:49:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 14:49:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-12-07 14:49:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 14:49:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 954 transitions. [2019-12-07 14:49:26,504 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 954 transitions. Word has length 98 [2019-12-07 14:49:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:26,504 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 954 transitions. [2019-12-07 14:49:26,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 954 transitions. [2019-12-07 14:49:26,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:49:26,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:26,505 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:26,506 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:26,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:26,506 INFO L82 PathProgramCache]: Analyzing trace with hash -875187613, now seen corresponding path program 1 times [2019-12-07 14:49:26,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:26,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769898513] [2019-12-07 14:49:26,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:49:26,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769898513] [2019-12-07 14:49:26,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:26,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:26,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894558047] [2019-12-07 14:49:26,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:26,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:26,545 INFO L87 Difference]: Start difference. First operand 643 states and 954 transitions. Second operand 4 states. [2019-12-07 14:49:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:26,979 INFO L93 Difference]: Finished difference Result 2085 states and 3049 transitions. [2019-12-07 14:49:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:26,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:49:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:26,985 INFO L225 Difference]: With dead ends: 2085 [2019-12-07 14:49:26,985 INFO L226 Difference]: Without dead ends: 1443 [2019-12-07 14:49:26,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2019-12-07 14:49:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2019-12-07 14:49:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-12-07 14:49:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1920 transitions. [2019-12-07 14:49:27,010 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1920 transitions. Word has length 102 [2019-12-07 14:49:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:27,010 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1920 transitions. [2019-12-07 14:49:27,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1920 transitions. [2019-12-07 14:49:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 14:49:27,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:27,012 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:27,012 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2118168047, now seen corresponding path program 1 times [2019-12-07 14:49:27,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:27,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865208658] [2019-12-07 14:49:27,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:49:27,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865208658] [2019-12-07 14:49:27,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:27,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:49:27,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359682549] [2019-12-07 14:49:27,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:27,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:27,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:27,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:49:27,085 INFO L87 Difference]: Start difference. First operand 1443 states and 1920 transitions. Second operand 4 states. [2019-12-07 14:49:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:27,531 INFO L93 Difference]: Finished difference Result 3365 states and 4520 transitions. [2019-12-07 14:49:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:27,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 14:49:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:27,542 INFO L225 Difference]: With dead ends: 3365 [2019-12-07 14:49:27,542 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 14:49:27,544 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 14:49:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 14:49:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1363. [2019-12-07 14:49:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 14:49:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1719 transitions. [2019-12-07 14:49:27,576 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1719 transitions. Word has length 107 [2019-12-07 14:49:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:27,577 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1719 transitions. [2019-12-07 14:49:27,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:27,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1719 transitions. [2019-12-07 14:49:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 14:49:27,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:27,579 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 14:49:27,579 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:27,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash 626750995, now seen corresponding path program 1 times [2019-12-07 14:49:27,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:27,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180391040] [2019-12-07 14:49:27,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 14:49:27,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180391040] [2019-12-07 14:49:27,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:27,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:49:27,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819289778] [2019-12-07 14:49:27,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:27,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:27,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:27,641 INFO L87 Difference]: Start difference. First operand 1363 states and 1719 transitions. Second operand 3 states. [2019-12-07 14:49:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:27,876 INFO L93 Difference]: Finished difference Result 2725 states and 3432 transitions. [2019-12-07 14:49:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:27,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-12-07 14:49:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:27,882 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 14:49:27,882 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 14:49:27,884 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-12-07 14:49:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 14:49:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1043. [2019-12-07 14:49:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-12-07 14:49:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1253 transitions. [2019-12-07 14:49:27,908 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1253 transitions. Word has length 171 [2019-12-07 14:49:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:27,908 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1253 transitions. [2019-12-07 14:49:27,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1253 transitions. [2019-12-07 14:49:27,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 14:49:27,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:27,912 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 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-12-07 14:49:27,912 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1232845627, now seen corresponding path program 1 times [2019-12-07 14:49:27,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:27,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958766409] [2019-12-07 14:49:27,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 14:49:27,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958766409] [2019-12-07 14:49:27,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:27,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:49:27,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53995957] [2019-12-07 14:49:27,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:27,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:27,954 INFO L87 Difference]: Start difference. First operand 1043 states and 1253 transitions. Second operand 3 states. [2019-12-07 14:49:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:28,144 INFO L93 Difference]: Finished difference Result 2405 states and 2880 transitions. [2019-12-07 14:49:28,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:28,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-12-07 14:49:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:28,149 INFO L225 Difference]: With dead ends: 2405 [2019-12-07 14:49:28,149 INFO L226 Difference]: Without dead ends: 1203 [2019-12-07 14:49:28,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 14:49:28,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-07 14:49:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 883. [2019-12-07 14:49:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 14:49:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1024 transitions. [2019-12-07 14:49:28,164 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1024 transitions. Word has length 173 [2019-12-07 14:49:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:28,164 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1024 transitions. [2019-12-07 14:49:28,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1024 transitions. [2019-12-07 14:49:28,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 14:49:28,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:28,166 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:49:28,166 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:28,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:28,167 INFO L82 PathProgramCache]: Analyzing trace with hash 271743606, now seen corresponding path program 1 times [2019-12-07 14:49:28,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:28,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729292335] [2019-12-07 14:49:28,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 14:49:28,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729292335] [2019-12-07 14:49:28,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579900886] [2019-12-07 14:49:28,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:28,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:49:28,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:49:28,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:49:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 14:49:28,398 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:49:28,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:49:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 14:49:28,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:49:28,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 6 [2019-12-07 14:49:28,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412830429] [2019-12-07 14:49:28,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:49:28,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:49:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:49:28,440 INFO L87 Difference]: Start difference. First operand 883 states and 1024 transitions. Second operand 5 states. [2019-12-07 14:49:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:28,873 INFO L93 Difference]: Finished difference Result 1961 states and 2277 transitions. [2019-12-07 14:49:28,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:49:28,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-12-07 14:49:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:28,877 INFO L225 Difference]: With dead ends: 1961 [2019-12-07 14:49:28,877 INFO L226 Difference]: Without dead ends: 1079 [2019-12-07 14:49:28,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 367 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:49:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-07 14:49:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 963. [2019-12-07 14:49:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 14:49:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1107 transitions. [2019-12-07 14:49:28,896 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1107 transitions. Word has length 185 [2019-12-07 14:49:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:28,896 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1107 transitions. [2019-12-07 14:49:28,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:49:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1107 transitions. [2019-12-07 14:49:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 14:49:28,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:28,899 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 14:49:29,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:29,100 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 137918307, now seen corresponding path program 1 times [2019-12-07 14:49:29,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:29,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586825795] [2019-12-07 14:49:29,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 14:49:29,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586825795] [2019-12-07 14:49:29,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:49:29,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:49:29,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977679882] [2019-12-07 14:49:29,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:49:29,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:49:29,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:49:29,169 INFO L87 Difference]: Start difference. First operand 963 states and 1107 transitions. Second operand 3 states. [2019-12-07 14:49:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:29,422 INFO L93 Difference]: Finished difference Result 2325 states and 2703 transitions. [2019-12-07 14:49:29,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:49:29,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 14:49:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:29,427 INFO L225 Difference]: With dead ends: 2325 [2019-12-07 14:49:29,427 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 14:49:29,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 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 14:49:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 14:49:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1123. [2019-12-07 14:49:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 14:49:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1265 transitions. [2019-12-07 14:49:29,452 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1265 transitions. Word has length 213 [2019-12-07 14:49:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:29,453 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1265 transitions. [2019-12-07 14:49:29,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:49:29,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1265 transitions. [2019-12-07 14:49:29,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 14:49:29,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:49:29,456 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 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, 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-12-07 14:49:29,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:49:29,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:49:29,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1989223210, now seen corresponding path program 1 times [2019-12-07 14:49:29,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:49:29,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109967818] [2019-12-07 14:49:29,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:49:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 14:49:29,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109967818] [2019-12-07 14:49:29,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80830755] [2019-12-07 14:49:29,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:49:29,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:49:29,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:49:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 14:49:29,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:49:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-12-07 14:49:29,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:49:29,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 10 [2019-12-07 14:49:29,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111556162] [2019-12-07 14:49:29,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:49:29,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:49:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:49:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:49:29,767 INFO L87 Difference]: Start difference. First operand 1123 states and 1265 transitions. Second operand 4 states. [2019-12-07 14:49:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:49:30,088 INFO L93 Difference]: Finished difference Result 2403 states and 2713 transitions. [2019-12-07 14:49:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:49:30,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-12-07 14:49:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:49:30,088 INFO L225 Difference]: With dead ends: 2403 [2019-12-07 14:49:30,088 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 14:49:30,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:49:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 14:49:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 14:49:30,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 14:49:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 14:49:30,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2019-12-07 14:49:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:49:30,091 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 14:49:30,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:49:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 14:49:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 14:49:30,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:49:30,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 14:49:30,633 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-12-07 14:49:30,859 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2019-12-07 14:49:30,862 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 14:49:30,862 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 14:49:30,862 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 14:49:30,862 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 14:49:30,862 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 14:49:30,863 INFO L246 CegarLoopResult]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L517(line 517) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 14:49:30,864 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse5 (= ~a11~0 1)) (.cse1 (= ~a19~0 1))) (let ((.cse9 (not .cse1)) (.cse4 (not (= ~a28~0 11))) (.cse2 (<= ~a25~0 0)) (.cse3 (not .cse5))) (let ((.cse7 (= ~a28~0 7)) (.cse6 (or (and .cse9 .cse2 .cse4) (and (<= ~a19~0 0) .cse2 .cse3))) (.cse0 (<= 10 ~a28~0)) (.cse10 (= ~a25~0 1)) (.cse11 (= ~a17~0 8)) (.cse8 (= ~a28~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse5 .cse10) (and .cse1 .cse7 .cse10 .cse5) (and .cse8 .cse11 (= ~a21~0 1) .cse2) (and .cse11 .cse6) (and .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse10 .cse3) (and .cse8 .cse11 .cse2 .cse5) (and .cse8 .cse9 .cse2))))) [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 14:49:30,865 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a11~0 1)) (.cse1 (= ~a19~0 1))) (let ((.cse9 (not .cse1)) (.cse4 (not (= ~a28~0 11))) (.cse2 (<= ~a25~0 0)) (.cse3 (not .cse5))) (let ((.cse7 (= ~a28~0 7)) (.cse6 (or (and .cse9 .cse2 .cse4) (and (<= ~a19~0 0) .cse2 .cse3))) (.cse0 (<= 10 ~a28~0)) (.cse10 (= ~a25~0 1)) (.cse11 (= ~a17~0 8)) (.cse8 (= ~a28~0 9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse5) (and .cse1 .cse7 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse5 .cse10) (and .cse1 .cse7 .cse10 .cse5) (and .cse8 .cse11 (= ~a21~0 1) .cse2) (and .cse11 .cse6) (and .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse10 .cse3) (and .cse8 .cse11 .cse2 .cse5) (and .cse8 .cse9 .cse2))))) [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 14:49:30,866 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 14:49:30,867 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 14:49:30,868 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 14:49:30,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:49:30 BoogieIcfgContainer [2019-12-07 14:49:30,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:49:30,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:49:30,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:49:30,889 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:49:30,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:49:24" (3/4) ... [2019-12-07 14:49:30,893 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 14:49:30,914 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 14:49:30,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 14:49:30,917 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 14:49:30,919 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 14:49:31,021 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4e007f1e-d467-48da-90ed-c40773c7d23c/bin/utaipan/witness.graphml [2019-12-07 14:49:31,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:49:31,022 INFO L168 Benchmark]: Toolchain (without parser) took 7905.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -292.7 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,022 INFO L168 Benchmark]: CDTParser took 0.17 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 14:49:31,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,023 INFO L168 Benchmark]: Boogie Preprocessor took 38.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,023 INFO L168 Benchmark]: RCFGBuilder took 1158.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 840.5 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,024 INFO L168 Benchmark]: TraceAbstraction took 6180.22 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 840.5 MB in the beginning and 1.2 GB in the end (delta: -401.3 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,024 INFO L168 Benchmark]: Witness Printer took 131.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:49:31,025 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1158.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 840.5 MB in the end (delta: 218.9 MB). Peak memory consumption was 218.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6180.22 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 273.7 MB). Free memory was 840.5 MB in the beginning and 1.2 GB in the end (delta: -401.3 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. * Witness Printer took 131.72 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB 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: 517]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a19 == 1) && a25 <= 0) && !(a11 == 1)) && !(a28 == 11)) || (a11 == 1 && (((!(a19 == 1) && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))))) || (((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1)) || ((((a19 == 1 && a28 == 7) && a25 <= 0) && !(a11 == 1)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && a25 == 1)) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || (((a28 == 9 && a17 == 8) && a21 == 1) && a25 <= 0)) || (a17 == 8 && (((!(a19 == 1) && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))))) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((10 <= a28 && a19 == 1) && a25 == 1) && !(a11 == 1))) || (((a28 == 9 && a17 == 8) && a25 <= 0) && a11 == 1)) || ((a28 == 9 && !(a19 == 1)) && a25 <= 0) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((10 <= a28 && a19 == 1) && a25 <= 0) && !(a11 == 1)) && !(a28 == 11)) || (a11 == 1 && (((!(a19 == 1) && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))))) || (((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1)) || ((((a19 == 1 && a28 == 7) && a25 <= 0) && !(a11 == 1)) && !(a28 == 11))) || (((a28 == 9 && !(a19 == 1)) && a11 == 1) && a25 == 1)) || (((a19 == 1 && a28 == 7) && a25 == 1) && a11 == 1)) || (((a28 == 9 && a17 == 8) && a21 == 1) && a25 <= 0)) || (a17 == 8 && (((!(a19 == 1) && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(a11 == 1))))) || ((a17 == 8 && a25 == 1) && !(a28 == 11))) || (((10 <= a28 && a19 == 1) && a25 == 1) && !(a11 == 1))) || (((a28 == 9 && a17 == 8) && a25 <= 0) && a11 == 1)) || ((a28 == 9 && !(a19 == 1)) && a25 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 5.5s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 797 SDtfs, 1097 SDslu, 113 SDs, 0 SdLazy, 3765 SolverSat, 903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 847 GetRequests, 813 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=5, 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, 11 MinimizatonAttempts, 1396 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 48 NumberOfFragments, 391 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2236 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1560 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1924 NumberOfCodeBlocks, 1924 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1041763 SizeOfPredicates, 8 NumberOfNonLiveVariables, 753 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 1768/1780 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...