./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label06.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_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label06.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/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 efd71a57cd4457ad6c114bfe7c857bcc7788c3aa ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:39:56,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:39:56,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:39:56,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:39:56,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:39:56,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:39:56,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:39:56,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:39:56,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:39:56,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:39:56,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:39:56,081 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:39:56,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:39:56,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:39:56,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:39:56,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:39:56,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:39:56,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:39:56,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:39:56,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:39:56,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:39:56,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:39:56,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:39:56,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:39:56,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:39:56,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:39:56,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:39:56,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:39:56,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:39:56,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:39:56,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:39:56,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:39:56,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:39:56,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:39:56,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:39:56,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:39:56,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:39:56,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:39:56,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:39:56,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:39:56,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:39:56,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:39:56,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:39:56,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:39:56,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:39:56,115 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:39:56,115 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:39:56,115 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:39:56,116 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:39:56,117 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:39:56,117 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:39:56,117 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:39:56,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:39:56,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:39:56,118 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:39:56,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:39:56,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:39:56,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:39:56,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:39:56,120 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_2467470f-8282-4d7c-8454-9ced691f9fb1/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 -> efd71a57cd4457ad6c114bfe7c857bcc7788c3aa [2019-12-07 10:39:56,235 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:39:56,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:39:56,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:39:56,247 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:39:56,247 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:39:56,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2019-12-07 10:39:56,290 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/data/83c9df029/2163569ccd4845ca9fca8fe3b17310e0/FLAGb1804c974 [2019-12-07 10:39:56,734 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:39:56,735 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/sv-benchmarks/c/eca-rers2012/Problem03_label06.c [2019-12-07 10:39:56,750 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/data/83c9df029/2163569ccd4845ca9fca8fe3b17310e0/FLAGb1804c974 [2019-12-07 10:39:56,762 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/data/83c9df029/2163569ccd4845ca9fca8fe3b17310e0 [2019-12-07 10:39:56,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:39:56,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:39:56,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:39:56,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:39:56,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:39:56,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:39:56" (1/1) ... [2019-12-07 10:39:56,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768a7773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:56, skipping insertion in model container [2019-12-07 10:39:56,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:39:56" (1/1) ... [2019-12-07 10:39:56,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:39:56,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:39:57,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:39:57,222 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:39:57,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:39:57,374 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:39:57,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57 WrapperNode [2019-12-07 10:39:57,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:39:57,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:39:57,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:39:57,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:39:57,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:39:57,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:39:57,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:39:57,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:39:57,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... [2019-12-07 10:39:57,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:39:57,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:39:57,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:39:57,519 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:39:57,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/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 10:39:57,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:39:57,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:39:59,353 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:39:59,353 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:39:59,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:39:59 BoogieIcfgContainer [2019-12-07 10:39:59,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:39:59,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:39:59,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:39:59,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:39:59,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:39:56" (1/3) ... [2019-12-07 10:39:59,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38549b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:39:59, skipping insertion in model container [2019-12-07 10:39:59,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:39:57" (2/3) ... [2019-12-07 10:39:59,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38549b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:39:59, skipping insertion in model container [2019-12-07 10:39:59,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:39:59" (3/3) ... [2019-12-07 10:39:59,359 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label06.c [2019-12-07 10:39:59,366 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:39:59,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:39:59,378 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:39:59,398 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:39:59,398 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:39:59,398 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:39:59,398 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:39:59,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:39:59,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:39:59,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:39:59,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:39:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 10:39:59,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 10:39:59,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:39:59,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:39:59,424 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:39:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:39:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1467446495, now seen corresponding path program 1 times [2019-12-07 10:39:59,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:39:59,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232472416] [2019-12-07 10:39:59,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:39:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:39:59,845 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 10:39:59,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232472416] [2019-12-07 10:39:59,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:39:59,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:39:59,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932249727] [2019-12-07 10:39:59,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:39:59,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:39:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:39:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:39:59,863 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 10:40:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:01,090 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-12-07 10:40:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:40:01,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 10:40:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:01,109 INFO L225 Difference]: With dead ends: 585 [2019-12-07 10:40:01,109 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 10:40:01,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 10:40:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2019-12-07 10:40:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-12-07 10:40:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 728 transitions. [2019-12-07 10:40:01,162 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 728 transitions. Word has length 143 [2019-12-07 10:40:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:01,163 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 728 transitions. [2019-12-07 10:40:01,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:40:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 728 transitions. [2019-12-07 10:40:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 10:40:01,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:01,168 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:01,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1977873472, now seen corresponding path program 1 times [2019-12-07 10:40:01,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:01,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996752899] [2019-12-07 10:40:01,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:40:01,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996752899] [2019-12-07 10:40:01,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:01,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:40:01,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605865548] [2019-12-07 10:40:01,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:01,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:01,241 INFO L87 Difference]: Start difference. First operand 432 states and 728 transitions. Second operand 3 states. [2019-12-07 10:40:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:01,762 INFO L93 Difference]: Finished difference Result 1292 states and 2181 transitions. [2019-12-07 10:40:01,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:01,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-12-07 10:40:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:01,766 INFO L225 Difference]: With dead ends: 1292 [2019-12-07 10:40:01,766 INFO L226 Difference]: Without dead ends: 861 [2019-12-07 10:40:01,769 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 10:40:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-07 10:40:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-12-07 10:40:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-07 10:40:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1411 transitions. [2019-12-07 10:40:01,801 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1411 transitions. Word has length 151 [2019-12-07 10:40:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:01,802 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1411 transitions. [2019-12-07 10:40:01,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1411 transitions. [2019-12-07 10:40:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 10:40:01,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:01,805 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:01,805 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash 559041383, now seen corresponding path program 1 times [2019-12-07 10:40:01,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:01,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465009067] [2019-12-07 10:40:01,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 10:40:01,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465009067] [2019-12-07 10:40:01,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:01,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:40:01,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546946860] [2019-12-07 10:40:01,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:01,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:01,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:01,868 INFO L87 Difference]: Start difference. First operand 861 states and 1411 transitions. Second operand 3 states. [2019-12-07 10:40:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:02,160 INFO L93 Difference]: Finished difference Result 2581 states and 4231 transitions. [2019-12-07 10:40:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:02,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-12-07 10:40:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:02,167 INFO L225 Difference]: With dead ends: 2581 [2019-12-07 10:40:02,167 INFO L226 Difference]: Without dead ends: 1721 [2019-12-07 10:40:02,169 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 10:40:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2019-12-07 10:40:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1719. [2019-12-07 10:40:02,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 10:40:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2808 transitions. [2019-12-07 10:40:02,196 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2808 transitions. Word has length 163 [2019-12-07 10:40:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:02,197 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2808 transitions. [2019-12-07 10:40:02,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2808 transitions. [2019-12-07 10:40:02,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 10:40:02,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:02,200 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:02,200 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1010833965, now seen corresponding path program 1 times [2019-12-07 10:40:02,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:02,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329787465] [2019-12-07 10:40:02,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 10:40:02,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329787465] [2019-12-07 10:40:02,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:02,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:40:02,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487483805] [2019-12-07 10:40:02,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:02,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:02,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:02,255 INFO L87 Difference]: Start difference. First operand 1719 states and 2808 transitions. Second operand 3 states. [2019-12-07 10:40:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:02,610 INFO L93 Difference]: Finished difference Result 3437 states and 5615 transitions. [2019-12-07 10:40:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:02,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-12-07 10:40:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:02,617 INFO L225 Difference]: With dead ends: 3437 [2019-12-07 10:40:02,618 INFO L226 Difference]: Without dead ends: 1719 [2019-12-07 10:40:02,619 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 10:40:02,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-12-07 10:40:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1719. [2019-12-07 10:40:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 10:40:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2732 transitions. [2019-12-07 10:40:02,656 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2732 transitions. Word has length 171 [2019-12-07 10:40:02,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:02,656 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2732 transitions. [2019-12-07 10:40:02,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:02,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2732 transitions. [2019-12-07 10:40:02,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 10:40:02,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:02,660 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:02,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:02,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1690903387, now seen corresponding path program 1 times [2019-12-07 10:40:02,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:02,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106493998] [2019-12-07 10:40:02,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:40:02,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106493998] [2019-12-07 10:40:02,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:02,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:40:02,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531663124] [2019-12-07 10:40:02,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:40:02,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:40:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:40:02,772 INFO L87 Difference]: Start difference. First operand 1719 states and 2732 transitions. Second operand 5 states. [2019-12-07 10:40:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:03,840 INFO L93 Difference]: Finished difference Result 4156 states and 6691 transitions. [2019-12-07 10:40:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:40:03,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-12-07 10:40:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:03,850 INFO L225 Difference]: With dead ends: 4156 [2019-12-07 10:40:03,851 INFO L226 Difference]: Without dead ends: 2438 [2019-12-07 10:40:03,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:40:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2019-12-07 10:40:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2005. [2019-12-07 10:40:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-12-07 10:40:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3202 transitions. [2019-12-07 10:40:03,883 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3202 transitions. Word has length 181 [2019-12-07 10:40:03,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:03,883 INFO L462 AbstractCegarLoop]: Abstraction has 2005 states and 3202 transitions. [2019-12-07 10:40:03,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:40:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3202 transitions. [2019-12-07 10:40:03,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-07 10:40:03,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:03,886 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:03,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:03,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1151907791, now seen corresponding path program 1 times [2019-12-07 10:40:03,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:03,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23548878] [2019-12-07 10:40:03,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-12-07 10:40:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23548878] [2019-12-07 10:40:03,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804113880] [2019-12-07 10:40:03,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/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 10:40:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:04,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:40:04,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:40:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-12-07 10:40:04,169 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:40:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-12-07 10:40:04,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:40:04,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 3 [2019-12-07 10:40:04,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549962149] [2019-12-07 10:40:04,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:04,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:04,208 INFO L87 Difference]: Start difference. First operand 2005 states and 3202 transitions. Second operand 3 states. [2019-12-07 10:40:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:04,459 INFO L93 Difference]: Finished difference Result 6013 states and 9604 transitions. [2019-12-07 10:40:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:04,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-12-07 10:40:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:04,474 INFO L225 Difference]: With dead ends: 6013 [2019-12-07 10:40:04,474 INFO L226 Difference]: Without dead ends: 4009 [2019-12-07 10:40:04,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-12-07 10:40:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 4007. [2019-12-07 10:40:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4007 states. [2019-12-07 10:40:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6380 transitions. [2019-12-07 10:40:04,538 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6380 transitions. Word has length 215 [2019-12-07 10:40:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 4007 states and 6380 transitions. [2019-12-07 10:40:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6380 transitions. [2019-12-07 10:40:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-12-07 10:40:04,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:04,543 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:40:04,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:40:04,744 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:04,744 INFO L82 PathProgramCache]: Analyzing trace with hash -645085295, now seen corresponding path program 1 times [2019-12-07 10:40:04,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:04,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141054736] [2019-12-07 10:40:04,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:40:04,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141054736] [2019-12-07 10:40:04,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:04,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:04,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879274426] [2019-12-07 10:40:04,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:04,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:04,838 INFO L87 Difference]: Start difference. First operand 4007 states and 6380 transitions. Second operand 3 states. [2019-12-07 10:40:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:05,377 INFO L93 Difference]: Finished difference Result 12017 states and 19137 transitions. [2019-12-07 10:40:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:05,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-12-07 10:40:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:05,405 INFO L225 Difference]: With dead ends: 12017 [2019-12-07 10:40:05,405 INFO L226 Difference]: Without dead ends: 8011 [2019-12-07 10:40:05,409 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 10:40:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8011 states. [2019-12-07 10:40:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8011 to 8011. [2019-12-07 10:40:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2019-12-07 10:40:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 11620 transitions. [2019-12-07 10:40:05,529 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 11620 transitions. Word has length 216 [2019-12-07 10:40:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:05,529 INFO L462 AbstractCegarLoop]: Abstraction has 8011 states and 11620 transitions. [2019-12-07 10:40:05,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 11620 transitions. [2019-12-07 10:40:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-12-07 10:40:05,537 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:05,538 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:40:05,538 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1739459712, now seen corresponding path program 1 times [2019-12-07 10:40:05,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:05,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34270251] [2019-12-07 10:40:05,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 10:40:05,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34270251] [2019-12-07 10:40:05,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:05,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:05,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677299301] [2019-12-07 10:40:05,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:05,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:05,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:05,602 INFO L87 Difference]: Start difference. First operand 8011 states and 11620 transitions. Second operand 3 states. [2019-12-07 10:40:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:06,209 INFO L93 Difference]: Finished difference Result 18023 states and 26582 transitions. [2019-12-07 10:40:06,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:06,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-12-07 10:40:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:06,242 INFO L225 Difference]: With dead ends: 18023 [2019-12-07 10:40:06,242 INFO L226 Difference]: Without dead ends: 10013 [2019-12-07 10:40:06,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 10:40:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-12-07 10:40:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 10013. [2019-12-07 10:40:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10013 states. [2019-12-07 10:40:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10013 states to 10013 states and 13732 transitions. [2019-12-07 10:40:06,360 INFO L78 Accepts]: Start accepts. Automaton has 10013 states and 13732 transitions. Word has length 220 [2019-12-07 10:40:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:06,360 INFO L462 AbstractCegarLoop]: Abstraction has 10013 states and 13732 transitions. [2019-12-07 10:40:06,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10013 states and 13732 transitions. [2019-12-07 10:40:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 10:40:06,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:06,367 INFO L410 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:06,368 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:06,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2120057763, now seen corresponding path program 1 times [2019-12-07 10:40:06,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:06,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191050867] [2019-12-07 10:40:06,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:40:06,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191050867] [2019-12-07 10:40:06,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:06,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:06,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020649553] [2019-12-07 10:40:06,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:40:06,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:06,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:40:06,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:06,474 INFO L87 Difference]: Start difference. First operand 10013 states and 13732 transitions. Second operand 4 states. [2019-12-07 10:40:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:07,312 INFO L93 Difference]: Finished difference Result 33181 states and 45027 transitions. [2019-12-07 10:40:07,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:40:07,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2019-12-07 10:40:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:07,349 INFO L225 Difference]: With dead ends: 33181 [2019-12-07 10:40:07,349 INFO L226 Difference]: Without dead ends: 23169 [2019-12-07 10:40:07,361 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 10:40:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23169 states. [2019-12-07 10:40:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23169 to 17449. [2019-12-07 10:40:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17449 states. [2019-12-07 10:40:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17449 states to 17449 states and 22836 transitions. [2019-12-07 10:40:07,571 INFO L78 Accepts]: Start accepts. Automaton has 17449 states and 22836 transitions. Word has length 221 [2019-12-07 10:40:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:07,571 INFO L462 AbstractCegarLoop]: Abstraction has 17449 states and 22836 transitions. [2019-12-07 10:40:07,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:40:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17449 states and 22836 transitions. [2019-12-07 10:40:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 10:40:07,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:07,580 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:07,580 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:07,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:07,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1247790124, now seen corresponding path program 1 times [2019-12-07 10:40:07,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:07,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029246623] [2019-12-07 10:40:07,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:40:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029246623] [2019-12-07 10:40:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3981722] [2019-12-07 10:40:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:40:07,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:07,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:40:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:07,688 INFO L87 Difference]: Start difference. First operand 17449 states and 22836 transitions. Second operand 4 states. [2019-12-07 10:40:08,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:08,307 INFO L93 Difference]: Finished difference Result 36041 states and 47387 transitions. [2019-12-07 10:40:08,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:40:08,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-12-07 10:40:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:08,329 INFO L225 Difference]: With dead ends: 36041 [2019-12-07 10:40:08,329 INFO L226 Difference]: Without dead ends: 18593 [2019-12-07 10:40:08,340 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 10:40:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18593 states. [2019-12-07 10:40:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18593 to 17163. [2019-12-07 10:40:08,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17163 states. [2019-12-07 10:40:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17163 states to 17163 states and 22152 transitions. [2019-12-07 10:40:08,482 INFO L78 Accepts]: Start accepts. Automaton has 17163 states and 22152 transitions. Word has length 229 [2019-12-07 10:40:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:08,482 INFO L462 AbstractCegarLoop]: Abstraction has 17163 states and 22152 transitions. [2019-12-07 10:40:08,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:40:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 17163 states and 22152 transitions. [2019-12-07 10:40:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-12-07 10:40:08,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:08,489 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:08,489 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1266272350, now seen corresponding path program 1 times [2019-12-07 10:40:08,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:08,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547858917] [2019-12-07 10:40:08,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 10:40:08,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547858917] [2019-12-07 10:40:08,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:08,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:08,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838511492] [2019-12-07 10:40:08,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:40:08,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:40:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:40:08,572 INFO L87 Difference]: Start difference. First operand 17163 states and 22152 transitions. Second operand 4 states. [2019-12-07 10:40:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:09,581 INFO L93 Difference]: Finished difference Result 66075 states and 85397 transitions. [2019-12-07 10:40:09,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:40:09,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 244 [2019-12-07 10:40:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:09,641 INFO L225 Difference]: With dead ends: 66075 [2019-12-07 10:40:09,642 INFO L226 Difference]: Without dead ends: 48913 [2019-12-07 10:40:09,658 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 10:40:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48913 states. [2019-12-07 10:40:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48913 to 48909. [2019-12-07 10:40:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48909 states. [2019-12-07 10:40:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48909 states to 48909 states and 63065 transitions. [2019-12-07 10:40:10,049 INFO L78 Accepts]: Start accepts. Automaton has 48909 states and 63065 transitions. Word has length 244 [2019-12-07 10:40:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:10,049 INFO L462 AbstractCegarLoop]: Abstraction has 48909 states and 63065 transitions. [2019-12-07 10:40:10,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:40:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48909 states and 63065 transitions. [2019-12-07 10:40:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-12-07 10:40:10,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:10,057 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:10,057 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1261932141, now seen corresponding path program 1 times [2019-12-07 10:40:10,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:10,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321217124] [2019-12-07 10:40:10,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 10:40:10,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321217124] [2019-12-07 10:40:10,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:10,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:40:10,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430008529] [2019-12-07 10:40:10,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:10,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:10,130 INFO L87 Difference]: Start difference. First operand 48909 states and 63065 transitions. Second operand 3 states. [2019-12-07 10:40:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:10,920 INFO L93 Difference]: Finished difference Result 119982 states and 153707 transitions. [2019-12-07 10:40:10,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:10,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-12-07 10:40:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:10,984 INFO L225 Difference]: With dead ends: 119982 [2019-12-07 10:40:10,984 INFO L226 Difference]: Without dead ends: 71074 [2019-12-07 10:40:11,010 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 10:40:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71074 states. [2019-12-07 10:40:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71074 to 71074. [2019-12-07 10:40:11,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71074 states. [2019-12-07 10:40:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71074 states to 71074 states and 90449 transitions. [2019-12-07 10:40:11,639 INFO L78 Accepts]: Start accepts. Automaton has 71074 states and 90449 transitions. Word has length 245 [2019-12-07 10:40:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:11,639 INFO L462 AbstractCegarLoop]: Abstraction has 71074 states and 90449 transitions. [2019-12-07 10:40:11,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 71074 states and 90449 transitions. [2019-12-07 10:40:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-07 10:40:11,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:11,651 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:40:11,651 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1387580400, now seen corresponding path program 1 times [2019-12-07 10:40:11,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:11,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551930649] [2019-12-07 10:40:11,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 10:40:11,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551930649] [2019-12-07 10:40:11,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120645207] [2019-12-07 10:40:11,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/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 10:40:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:11,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:40:11,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:40:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 10:40:11,982 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:40:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-12-07 10:40:12,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:40:12,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [4] total 5 [2019-12-07 10:40:12,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961869455] [2019-12-07 10:40:12,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:40:12,038 INFO L87 Difference]: Start difference. First operand 71074 states and 90449 transitions. Second operand 3 states. [2019-12-07 10:40:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:12,876 INFO L93 Difference]: Finished difference Result 174036 states and 223299 transitions. [2019-12-07 10:40:12,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:12,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-12-07 10:40:12,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:12,980 INFO L225 Difference]: With dead ends: 174036 [2019-12-07 10:40:12,980 INFO L226 Difference]: Without dead ends: 102963 [2019-12-07 10:40:13,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:40:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102963 states. [2019-12-07 10:40:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102963 to 102963. [2019-12-07 10:40:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102963 states. [2019-12-07 10:40:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102963 states to 102963 states and 129561 transitions. [2019-12-07 10:40:14,076 INFO L78 Accepts]: Start accepts. Automaton has 102963 states and 129561 transitions. Word has length 252 [2019-12-07 10:40:14,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:14,077 INFO L462 AbstractCegarLoop]: Abstraction has 102963 states and 129561 transitions. [2019-12-07 10:40:14,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 102963 states and 129561 transitions. [2019-12-07 10:40:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-12-07 10:40:14,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:14,100 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2019-12-07 10:40:14,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:40:14,301 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -424880394, now seen corresponding path program 1 times [2019-12-07 10:40:14,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:14,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14004085] [2019-12-07 10:40:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 10:40:14,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14004085] [2019-12-07 10:40:14,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:14,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:14,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748584337] [2019-12-07 10:40:14,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:14,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:14,464 INFO L87 Difference]: Start difference. First operand 102963 states and 129561 transitions. Second operand 3 states. [2019-12-07 10:40:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:15,534 INFO L93 Difference]: Finished difference Result 263127 states and 328537 transitions. [2019-12-07 10:40:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:15,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-12-07 10:40:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:15,694 INFO L225 Difference]: With dead ends: 263127 [2019-12-07 10:40:15,694 INFO L226 Difference]: Without dead ends: 160165 [2019-12-07 10:40:15,740 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 10:40:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160165 states. [2019-12-07 10:40:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160165 to 141430. [2019-12-07 10:40:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141430 states. [2019-12-07 10:40:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141430 states to 141430 states and 178154 transitions. [2019-12-07 10:40:17,443 INFO L78 Accepts]: Start accepts. Automaton has 141430 states and 178154 transitions. Word has length 302 [2019-12-07 10:40:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:17,443 INFO L462 AbstractCegarLoop]: Abstraction has 141430 states and 178154 transitions. [2019-12-07 10:40:17,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 141430 states and 178154 transitions. [2019-12-07 10:40:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-12-07 10:40:17,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:17,465 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1] [2019-12-07 10:40:17,465 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1644458127, now seen corresponding path program 1 times [2019-12-07 10:40:17,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:17,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198531837] [2019-12-07 10:40:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-07 10:40:17,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198531837] [2019-12-07 10:40:17,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:40:17,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:40:17,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230676457] [2019-12-07 10:40:17,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:40:17,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:17,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:40:17,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:40:17,632 INFO L87 Difference]: Start difference. First operand 141430 states and 178154 transitions. Second operand 3 states. [2019-12-07 10:40:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:18,818 INFO L93 Difference]: Finished difference Result 322041 states and 403762 transitions. [2019-12-07 10:40:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:40:18,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-12-07 10:40:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:19,002 INFO L225 Difference]: With dead ends: 322041 [2019-12-07 10:40:19,002 INFO L226 Difference]: Without dead ends: 180612 [2019-12-07 10:40:19,069 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 10:40:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180612 states. [2019-12-07 10:40:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180612 to 177752. [2019-12-07 10:40:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177752 states. [2019-12-07 10:40:21,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177752 states to 177752 states and 218347 transitions. [2019-12-07 10:40:21,055 INFO L78 Accepts]: Start accepts. Automaton has 177752 states and 218347 transitions. Word has length 324 [2019-12-07 10:40:21,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:21,055 INFO L462 AbstractCegarLoop]: Abstraction has 177752 states and 218347 transitions. [2019-12-07 10:40:21,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:40:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 177752 states and 218347 transitions. [2019-12-07 10:40:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-12-07 10:40:21,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:40:21,087 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-12-07 10:40:21,087 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:40:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:40:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash 829419359, now seen corresponding path program 1 times [2019-12-07 10:40:21,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:40:21,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197567256] [2019-12-07 10:40:21,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:40:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 196 proven. 8 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 10:40:21,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197567256] [2019-12-07 10:40:21,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489452322] [2019-12-07 10:40:21,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:40:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:40:21,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:40:21,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:40:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 10:40:22,953 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:40:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-12-07 10:40:23,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:40:23,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 9 [2019-12-07 10:40:23,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051362613] [2019-12-07 10:40:23,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:40:23,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:40:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:40:23,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:40:23,068 INFO L87 Difference]: Start difference. First operand 177752 states and 218347 transitions. Second operand 4 states. [2019-12-07 10:40:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:40:24,785 INFO L93 Difference]: Finished difference Result 406123 states and 498329 transitions. [2019-12-07 10:40:24,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:40:24,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2019-12-07 10:40:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:40:24,786 INFO L225 Difference]: With dead ends: 406123 [2019-12-07 10:40:24,786 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:40:24,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:40:24,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:40:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:40:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:40:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:40:24,883 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 360 [2019-12-07 10:40:24,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:40:24,883 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:40:24,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:40:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:40:24,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:40:25,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:40:25,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:40:32,762 WARN L192 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 2208 DAG size of output: 536 [2019-12-07 10:40:40,317 WARN L192 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 2208 DAG size of output: 536 [2019-12-07 10:40:43,979 WARN L192 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 522 DAG size of output: 60 [2019-12-07 10:40:47,811 WARN L192 SmtUtils]: Spent 3.83 s on a formula simplification. DAG size of input: 522 DAG size of output: 60 [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,813 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,814 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,815 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse10 (= 1 ~a7~0)) (.cse12 (= ~a26~0 1))) (let ((.cse8 (or .cse10 .cse12)) (.cse5 (= ~a15~0 1)) (.cse9 (= ~a11~0 1)) (.cse0 (= ~a10~0 1)) (.cse7 (= ~a12~0 1)) (.cse3 (= 0 ~a3~0)) (.cse4 (not (= 1 ~a6~0))) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse11 (<= ~a11~0 0)) (.cse6 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse1 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse2 (not .cse10) .cse8 .cse5) (and (not .cse3) .cse2) (and .cse1 .cse2 .cse8 .cse6) (and .cse2 .cse7 .cse11) (and .cse2 .cse7 .cse3 .cse4 .cse6) (and .cse1 .cse2 .cse11 .cse5) (and .cse1 .cse2 .cse9 .cse6) (and .cse2 .cse7 (not .cse1) .cse6) (and (or .cse1 .cse12) .cse2 .cse7 .cse9) (and (<= ~a6~0 0) .cse2 .cse7) (and .cse2 (or (and (= ~a27~0 0) .cse12) (and .cse1 (= ~a26~0 0)))) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse11 .cse6)))) [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,816 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1542) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,817 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse10 (= 1 ~a7~0)) (.cse12 (= ~a26~0 1))) (let ((.cse8 (or .cse10 .cse12)) (.cse5 (= ~a15~0 1)) (.cse9 (= ~a11~0 1)) (.cse0 (= ~a10~0 1)) (.cse7 (= ~a12~0 1)) (.cse3 (= 0 ~a3~0)) (.cse4 (not (= 1 ~a6~0))) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse11 (<= ~a11~0 0)) (.cse6 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse7 .cse8) (and .cse1 .cse2 .cse9 .cse5) (and .cse0 .cse1 .cse2 (not .cse10) .cse8 .cse5) (and (not .cse3) .cse2) (and .cse1 .cse2 .cse8 .cse6) (and .cse2 .cse7 .cse11) (and .cse2 .cse7 .cse3 .cse4 .cse6) (and .cse1 .cse2 .cse11 .cse5) (and .cse1 .cse2 .cse9 .cse6) (and .cse2 .cse7 (not .cse1) .cse6) (and (or .cse1 .cse12) .cse2 .cse7 .cse9) (and (<= ~a6~0 0) .cse2 .cse7) (and .cse2 (or (and (= ~a27~0 0) .cse12) (and .cse1 (= ~a26~0 0)))) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse1 .cse2 .cse11 .cse6)))) [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,818 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 10:40:47,819 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,820 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,821 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,821 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,821 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,821 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,821 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 10:40:47,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:40:47 BoogieIcfgContainer [2019-12-07 10:40:47,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:40:47,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:40:47,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:40:47,844 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:40:47,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:39:59" (3/4) ... [2019-12-07 10:40:47,846 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:40:47,870 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 115 nodes and edges [2019-12-07 10:40:47,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 10:40:47,875 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 10:40:47,878 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:40:47,995 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2467470f-8282-4d7c-8454-9ced691f9fb1/bin/utaipan/witness.graphml [2019-12-07 10:40:47,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:40:47,996 INFO L168 Benchmark]: Toolchain (without parser) took 51230.87 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 934.0 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,997 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:40:47,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.45 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.0 GB in the end (delta: -97.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,997 INFO L168 Benchmark]: Boogie Preprocessor took 62.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,998 INFO L168 Benchmark]: RCFGBuilder took 1835.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 815.6 MB in the end (delta: 188.9 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,998 INFO L168 Benchmark]: TraceAbstraction took 48487.94 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 815.6 MB in the beginning and 3.6 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,998 INFO L168 Benchmark]: Witness Printer took 152.13 ms. Allocated memory is still 5.3 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:40:47,999 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 607.45 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.0 GB in the end (delta: -97.4 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1835.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 815.6 MB in the end (delta: 188.9 MB). Peak memory consumption was 195.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48487.94 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 815.6 MB in the beginning and 3.6 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 152.13 ms. Allocated memory is still 5.3 GB. Free memory was 3.6 GB in the beginning and 3.6 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a10 == 1 && a27 == 1) && 1 == a5) && 0 == a3) && !(1 == a6)) && a15 == 1) || (((((a27 == 1 && 1 == a5) && 0 == a3) && !(1 == a6)) && a16 == 1) && a15 == 1)) || ((((a10 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && (1 == a7 || a26 == 1))) || (((a27 == 1 && 1 == a5) && a11 == 1) && a15 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && !(1 == a7)) && (1 == a7 || a26 == 1)) && a15 == 1)) || (!(0 == a3) && 1 == a5)) || (((a27 == 1 && 1 == a5) && (1 == a7 || a26 == 1)) && a16 == 1)) || ((1 == a5 && a12 == 1) && a11 <= 0)) || ((((1 == a5 && a12 == 1) && 0 == a3) && !(1 == a6)) && a16 == 1)) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a15 == 1)) || (((a27 == 1 && 1 == a5) && a11 == 1) && a16 == 1)) || (((1 == a5 && a12 == 1) && !(a27 == 1)) && a16 == 1)) || ((((a27 == 1 || a26 == 1) && 1 == a5) && a12 == 1) && a11 == 1)) || ((a6 <= 0 && 1 == a5) && a12 == 1)) || (1 == a5 && ((a27 == 0 && a26 == 1) || (a27 == 1 && a26 == 0)))) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && 0 == a3) && !(1 == a6))) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a10 == 1 && a27 == 1) && 1 == a5) && 0 == a3) && !(1 == a6)) && a15 == 1) || (((((a27 == 1 && 1 == a5) && 0 == a3) && !(1 == a6)) && a16 == 1) && a15 == 1)) || ((((a10 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && (1 == a7 || a26 == 1))) || (((a27 == 1 && 1 == a5) && a11 == 1) && a15 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && !(1 == a7)) && (1 == a7 || a26 == 1)) && a15 == 1)) || (!(0 == a3) && 1 == a5)) || (((a27 == 1 && 1 == a5) && (1 == a7 || a26 == 1)) && a16 == 1)) || ((1 == a5 && a12 == 1) && a11 <= 0)) || ((((1 == a5 && a12 == 1) && 0 == a3) && !(1 == a6)) && a16 == 1)) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a15 == 1)) || (((a27 == 1 && 1 == a5) && a11 == 1) && a16 == 1)) || (((1 == a5 && a12 == 1) && !(a27 == 1)) && a16 == 1)) || ((((a27 == 1 || a26 == 1) && 1 == a5) && a12 == 1) && a11 == 1)) || ((a6 <= 0 && 1 == a5) && a12 == 1)) || (1 == a5 && ((a27 == 0 && a26 == 1) || (a27 == 1 && a26 == 0)))) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a12 == 1) && 0 == a3) && !(1 == a6))) || (((a27 == 1 && 1 == a5) && a11 <= 0) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 25.6s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 14.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.7s, HoareTripleCheckerStatistics: 1843 SDtfs, 3459 SDslu, 568 SDs, 0 SdLazy, 8377 SolverSat, 2161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1703 GetRequests, 1663 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177752occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 29186 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3200 NumberOfFragments, 539 HoareAnnotationTreeSize, 3 FomulaSimplifications, 157826 FormulaSimplificationTreeSizeReduction, 15.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 34368 FormulaSimplificationTreeSizeReductionInter, 7.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 4464 NumberOfCodeBlocks, 4464 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5269 ConstructedInterpolants, 0 QuantifiedInterpolants, 3590594 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1657 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 2998/3017 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...