./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/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 0c244c639ec9718adcbacffa967b748c52a23cd0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:50:10,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:50:10,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:50:10,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:50:10,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:50:10,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:50:10,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:50:10,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:50:10,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:50:10,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:50:10,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:50:10,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:50:10,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:50:10,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:50:10,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:50:10,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:50:10,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:50:10,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:50:10,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:50:10,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:50:10,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:50:10,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:50:10,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:50:10,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:50:10,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:50:10,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:50:10,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:50:10,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:50:10,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:50:10,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:50:10,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:50:10,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:50:10,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:50:10,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:50:10,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:50:10,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:50:10,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:50:10,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:50:10,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:50:10,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:50:10,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:50:10,602 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:50:10,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:50:10,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:50:10,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:50:10,633 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:50:10,633 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:50:10,634 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:50:10,634 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:50:10,634 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:50:10,634 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:50:10,635 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:50:10,635 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:50:10,635 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:50:10,635 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:50:10,636 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:50:10,636 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:50:10,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:50:10,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:50:10,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:50:10,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:50:10,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:50:10,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:50:10,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:50:10,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:50:10,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:50:10,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:50:10,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:50:10,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:50:10,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:50:10,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:50:10,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:50:10,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:50:10,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:50:10,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:50:10,643 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:50:10,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:50:10,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:50:10,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:50:10,644 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_2141966d-a275-4cad-a807-6ecff7de064d/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 -> 0c244c639ec9718adcbacffa967b748c52a23cd0 [2019-11-26 02:50:10,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:50:10,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:50:10,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:50:10,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:50:10,799 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:50:10,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-26 02:50:10,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/data/0f524e930/13a58199d475409fb8b14f23d21ad5c4/FLAG993eb1ea3 [2019-11-26 02:50:11,259 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:50:11,260 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-26 02:50:11,270 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/data/0f524e930/13a58199d475409fb8b14f23d21ad5c4/FLAG993eb1ea3 [2019-11-26 02:50:11,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/data/0f524e930/13a58199d475409fb8b14f23d21ad5c4 [2019-11-26 02:50:11,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:50:11,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:50:11,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:50:11,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:50:11,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:50:11,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:50:11" (1/1) ... [2019-11-26 02:50:11,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6781c465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:11, skipping insertion in model container [2019-11-26 02:50:11,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:50:11" (1/1) ... [2019-11-26 02:50:11,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:50:11,704 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:50:11,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:50:11,946 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:50:11,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:50:12,007 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:50:12,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12 WrapperNode [2019-11-26 02:50:12,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:50:12,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:50:12,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:50:12,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:50:12,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:50:12,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:50:12,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:50:12,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:50:12,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... [2019-11-26 02:50:12,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:50:12,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:50:12,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:50:12,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:50:12,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:50:12,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:50:12,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:50:13,636 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:50:13,637 INFO L284 CfgBuilder]: Removed 94 assume(true) statements. [2019-11-26 02:50:13,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:50:13 BoogieIcfgContainer [2019-11-26 02:50:13,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:50:13,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:50:13,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:50:13,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:50:13,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:50:11" (1/3) ... [2019-11-26 02:50:13,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ddcf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:50:13, skipping insertion in model container [2019-11-26 02:50:13,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:50:12" (2/3) ... [2019-11-26 02:50:13,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ddcf36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:50:13, skipping insertion in model container [2019-11-26 02:50:13,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:50:13" (3/3) ... [2019-11-26 02:50:13,646 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-26 02:50:13,656 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:50:13,663 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:50:13,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:50:13,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:50:13,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:50:13,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:50:13,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:50:13,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:50:13,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:50:13,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:50:13,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:50:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-26 02:50:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:50:13,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:13,741 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] [2019-11-26 02:50:13,741 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -68201116, now seen corresponding path program 1 times [2019-11-26 02:50:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:13,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807397519] [2019-11-26 02:50:13,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:13,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807397519] [2019-11-26 02:50:13,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:13,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:50:13,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119786319] [2019-11-26 02:50:13,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:13,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:13,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:13,941 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 3 states. [2019-11-26 02:50:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:14,030 INFO L93 Difference]: Finished difference Result 229 states and 354 transitions. [2019-11-26 02:50:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:14,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:50:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:14,045 INFO L225 Difference]: With dead ends: 229 [2019-11-26 02:50:14,045 INFO L226 Difference]: Without dead ends: 143 [2019-11-26 02:50:14,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-26 02:50:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-11-26 02:50:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 02:50:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2019-11-26 02:50:14,112 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 20 [2019-11-26 02:50:14,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:14,113 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2019-11-26 02:50:14,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2019-11-26 02:50:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:50:14,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:14,115 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] [2019-11-26 02:50:14,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1108403203, now seen corresponding path program 1 times [2019-11-26 02:50:14,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:14,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005835793] [2019-11-26 02:50:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:14,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005835793] [2019-11-26 02:50:14,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:14,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:50:14,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724171982] [2019-11-26 02:50:14,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:14,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:14,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,233 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand 3 states. [2019-11-26 02:50:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:14,286 INFO L93 Difference]: Finished difference Result 387 states and 569 transitions. [2019-11-26 02:50:14,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:14,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:50:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:14,289 INFO L225 Difference]: With dead ends: 387 [2019-11-26 02:50:14,289 INFO L226 Difference]: Without dead ends: 256 [2019-11-26 02:50:14,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-26 02:50:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-11-26 02:50:14,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-26 02:50:14,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 363 transitions. [2019-11-26 02:50:14,316 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 363 transitions. Word has length 20 [2019-11-26 02:50:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:14,317 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 363 transitions. [2019-11-26 02:50:14,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 363 transitions. [2019-11-26 02:50:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:50:14,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:14,320 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] [2019-11-26 02:50:14,320 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -413525998, now seen corresponding path program 1 times [2019-11-26 02:50:14,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:14,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939439320] [2019-11-26 02:50:14,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:14,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939439320] [2019-11-26 02:50:14,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:14,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:50:14,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717485162] [2019-11-26 02:50:14,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:50:14,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:14,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:50:14,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:50:14,400 INFO L87 Difference]: Start difference. First operand 254 states and 363 transitions. Second operand 4 states. [2019-11-26 02:50:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:14,519 INFO L93 Difference]: Finished difference Result 753 states and 1094 transitions. [2019-11-26 02:50:14,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:50:14,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-26 02:50:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:14,525 INFO L225 Difference]: With dead ends: 753 [2019-11-26 02:50:14,527 INFO L226 Difference]: Without dead ends: 510 [2019-11-26 02:50:14,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:50:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-26 02:50:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 304. [2019-11-26 02:50:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-26 02:50:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 447 transitions. [2019-11-26 02:50:14,575 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 447 transitions. Word has length 28 [2019-11-26 02:50:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:14,576 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 447 transitions. [2019-11-26 02:50:14,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:50:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 447 transitions. [2019-11-26 02:50:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-26 02:50:14,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:14,584 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:50:14,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1969112911, now seen corresponding path program 1 times [2019-11-26 02:50:14,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:14,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385456302] [2019-11-26 02:50:14,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:14,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385456302] [2019-11-26 02:50:14,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:14,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:50:14,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98795183] [2019-11-26 02:50:14,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:14,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,678 INFO L87 Difference]: Start difference. First operand 304 states and 447 transitions. Second operand 3 states. [2019-11-26 02:50:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:14,729 INFO L93 Difference]: Finished difference Result 711 states and 1062 transitions. [2019-11-26 02:50:14,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:14,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-26 02:50:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:14,733 INFO L225 Difference]: With dead ends: 711 [2019-11-26 02:50:14,733 INFO L226 Difference]: Without dead ends: 418 [2019-11-26 02:50:14,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-26 02:50:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-11-26 02:50:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-26 02:50:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 575 transitions. [2019-11-26 02:50:14,754 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 575 transitions. Word has length 41 [2019-11-26 02:50:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:14,755 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 575 transitions. [2019-11-26 02:50:14,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:14,755 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 575 transitions. [2019-11-26 02:50:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:50:14,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:14,757 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] [2019-11-26 02:50:14,757 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:14,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:14,758 INFO L82 PathProgramCache]: Analyzing trace with hash -567026932, now seen corresponding path program 1 times [2019-11-26 02:50:14,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:14,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807116617] [2019-11-26 02:50:14,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:50:14,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807116617] [2019-11-26 02:50:14,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:14,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:50:14,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208115925] [2019-11-26 02:50:14,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:14,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:14,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:14,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,818 INFO L87 Difference]: Start difference. First operand 384 states and 575 transitions. Second operand 3 states. [2019-11-26 02:50:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:14,859 INFO L93 Difference]: Finished difference Result 579 states and 875 transitions. [2019-11-26 02:50:14,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:14,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-26 02:50:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:14,863 INFO L225 Difference]: With dead ends: 579 [2019-11-26 02:50:14,863 INFO L226 Difference]: Without dead ends: 384 [2019-11-26 02:50:14,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-26 02:50:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-11-26 02:50:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-26 02:50:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 569 transitions. [2019-11-26 02:50:14,884 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 569 transitions. Word has length 42 [2019-11-26 02:50:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:14,885 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 569 transitions. [2019-11-26 02:50:14,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 569 transitions. [2019-11-26 02:50:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-26 02:50:14,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:14,887 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] [2019-11-26 02:50:14,887 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:14,888 INFO L82 PathProgramCache]: Analyzing trace with hash 97553643, now seen corresponding path program 1 times [2019-11-26 02:50:14,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:14,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919818052] [2019-11-26 02:50:14,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:14,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:14,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919818052] [2019-11-26 02:50:14,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:14,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:50:14,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315217437] [2019-11-26 02:50:14,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:14,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:14,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:14,930 INFO L87 Difference]: Start difference. First operand 384 states and 569 transitions. Second operand 3 states. [2019-11-26 02:50:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,000 INFO L93 Difference]: Finished difference Result 579 states and 863 transitions. [2019-11-26 02:50:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:15,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-26 02:50:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,003 INFO L225 Difference]: With dead ends: 579 [2019-11-26 02:50:15,003 INFO L226 Difference]: Without dead ends: 384 [2019-11-26 02:50:15,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-26 02:50:15,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2019-11-26 02:50:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-26 02:50:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 548 transitions. [2019-11-26 02:50:15,023 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 548 transitions. Word has length 42 [2019-11-26 02:50:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,023 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 548 transitions. [2019-11-26 02:50:15,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 548 transitions. [2019-11-26 02:50:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-26 02:50:15,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,025 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] [2019-11-26 02:50:15,025 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1918967368, now seen corresponding path program 1 times [2019-11-26 02:50:15,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133286830] [2019-11-26 02:50:15,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:15,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133286830] [2019-11-26 02:50:15,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:50:15,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243336922] [2019-11-26 02:50:15,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:50:15,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:50:15,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:50:15,111 INFO L87 Difference]: Start difference. First operand 378 states and 548 transitions. Second operand 5 states. [2019-11-26 02:50:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,229 INFO L93 Difference]: Finished difference Result 833 states and 1202 transitions. [2019-11-26 02:50:15,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:50:15,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-26 02:50:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,234 INFO L225 Difference]: With dead ends: 833 [2019-11-26 02:50:15,234 INFO L226 Difference]: Without dead ends: 648 [2019-11-26 02:50:15,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:50:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-11-26 02:50:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 432. [2019-11-26 02:50:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-26 02:50:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 618 transitions. [2019-11-26 02:50:15,256 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 618 transitions. Word has length 43 [2019-11-26 02:50:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,257 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 618 transitions. [2019-11-26 02:50:15,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:50:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 618 transitions. [2019-11-26 02:50:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-26 02:50:15,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,258 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:15,259 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash 121100221, now seen corresponding path program 1 times [2019-11-26 02:50:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400861381] [2019-11-26 02:50:15,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:15,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400861381] [2019-11-26 02:50:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:50:15,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672750569] [2019-11-26 02:50:15,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:50:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:50:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:50:15,293 INFO L87 Difference]: Start difference. First operand 432 states and 618 transitions. Second operand 4 states. [2019-11-26 02:50:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,374 INFO L93 Difference]: Finished difference Result 1208 states and 1756 transitions. [2019-11-26 02:50:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:50:15,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-26 02:50:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,379 INFO L225 Difference]: With dead ends: 1208 [2019-11-26 02:50:15,380 INFO L226 Difference]: Without dead ends: 787 [2019-11-26 02:50:15,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:50:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-11-26 02:50:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 558. [2019-11-26 02:50:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2019-11-26 02:50:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 804 transitions. [2019-11-26 02:50:15,411 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 804 transitions. Word has length 44 [2019-11-26 02:50:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,411 INFO L462 AbstractCegarLoop]: Abstraction has 558 states and 804 transitions. [2019-11-26 02:50:15,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:50:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 804 transitions. [2019-11-26 02:50:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-26 02:50:15,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:15,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1780456656, now seen corresponding path program 1 times [2019-11-26 02:50:15,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948775262] [2019-11-26 02:50:15,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:50:15,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948775262] [2019-11-26 02:50:15,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:50:15,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560684641] [2019-11-26 02:50:15,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:15,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:15,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,450 INFO L87 Difference]: Start difference. First operand 558 states and 804 transitions. Second operand 3 states. [2019-11-26 02:50:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,498 INFO L93 Difference]: Finished difference Result 915 states and 1329 transitions. [2019-11-26 02:50:15,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-26 02:50:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,502 INFO L225 Difference]: With dead ends: 915 [2019-11-26 02:50:15,502 INFO L226 Difference]: Without dead ends: 557 [2019-11-26 02:50:15,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-11-26 02:50:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 541. [2019-11-26 02:50:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-26 02:50:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 755 transitions. [2019-11-26 02:50:15,532 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 755 transitions. Word has length 59 [2019-11-26 02:50:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,532 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 755 transitions. [2019-11-26 02:50:15,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 755 transitions. [2019-11-26 02:50:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-26 02:50:15,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,534 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:15,534 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -492262127, now seen corresponding path program 1 times [2019-11-26 02:50:15,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116473807] [2019-11-26 02:50:15,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:50:15,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116473807] [2019-11-26 02:50:15,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:50:15,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318145310] [2019-11-26 02:50:15,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:15,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,568 INFO L87 Difference]: Start difference. First operand 541 states and 755 transitions. Second operand 3 states. [2019-11-26 02:50:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,616 INFO L93 Difference]: Finished difference Result 878 states and 1228 transitions. [2019-11-26 02:50:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:15,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-26 02:50:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,619 INFO L225 Difference]: With dead ends: 878 [2019-11-26 02:50:15,620 INFO L226 Difference]: Without dead ends: 541 [2019-11-26 02:50:15,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-11-26 02:50:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-11-26 02:50:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-11-26 02:50:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 746 transitions. [2019-11-26 02:50:15,651 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 746 transitions. Word has length 59 [2019-11-26 02:50:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,652 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 746 transitions. [2019-11-26 02:50:15,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 746 transitions. [2019-11-26 02:50:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 02:50:15,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,653 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:15,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1424968503, now seen corresponding path program 1 times [2019-11-26 02:50:15,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983783329] [2019-11-26 02:50:15,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:50:15,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983783329] [2019-11-26 02:50:15,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:50:15,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218519] [2019-11-26 02:50:15,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:15,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,696 INFO L87 Difference]: Start difference. First operand 541 states and 746 transitions. Second operand 3 states. [2019-11-26 02:50:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:15,781 INFO L93 Difference]: Finished difference Result 1552 states and 2153 transitions. [2019-11-26 02:50:15,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:15,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-26 02:50:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:15,787 INFO L225 Difference]: With dead ends: 1552 [2019-11-26 02:50:15,787 INFO L226 Difference]: Without dead ends: 1015 [2019-11-26 02:50:15,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-26 02:50:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1011. [2019-11-26 02:50:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2019-11-26 02:50:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1396 transitions. [2019-11-26 02:50:15,848 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1396 transitions. Word has length 60 [2019-11-26 02:50:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:15,848 INFO L462 AbstractCegarLoop]: Abstraction has 1011 states and 1396 transitions. [2019-11-26 02:50:15,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1396 transitions. [2019-11-26 02:50:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 02:50:15,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:15,850 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:15,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1693394474, now seen corresponding path program 1 times [2019-11-26 02:50:15,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:15,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532766283] [2019-11-26 02:50:15,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:50:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 02:50:15,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532766283] [2019-11-26 02:50:15,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:50:15,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:50:15,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400448161] [2019-11-26 02:50:15,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:50:15,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:50:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:50:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:15,881 INFO L87 Difference]: Start difference. First operand 1011 states and 1396 transitions. Second operand 3 states. [2019-11-26 02:50:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:50:16,025 INFO L93 Difference]: Finished difference Result 2946 states and 4071 transitions. [2019-11-26 02:50:16,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:50:16,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-26 02:50:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:50:16,036 INFO L225 Difference]: With dead ends: 2946 [2019-11-26 02:50:16,036 INFO L226 Difference]: Without dead ends: 1946 [2019-11-26 02:50:16,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:50:16,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-11-26 02:50:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1840. [2019-11-26 02:50:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-11-26 02:50:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2491 transitions. [2019-11-26 02:50:16,148 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2491 transitions. Word has length 60 [2019-11-26 02:50:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:50:16,148 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 2491 transitions. [2019-11-26 02:50:16,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:50:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2491 transitions. [2019-11-26 02:50:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-26 02:50:16,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:50:16,152 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:50:16,152 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:50:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:50:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 439163272, now seen corresponding path program 1 times [2019-11-26 02:50:16,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:50:16,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613423917] [2019-11-26 02:50:16,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:50:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:50:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:50:16,270 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:50:16,271 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:50:16,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:50:16 BoogieIcfgContainer [2019-11-26 02:50:16,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:50:16,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:50:16,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:50:16,375 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:50:16,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:50:13" (3/4) ... [2019-11-26 02:50:16,377 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-26 02:50:16,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2141966d-a275-4cad-a807-6ecff7de064d/bin/utaipan/witness.graphml [2019-11-26 02:50:16,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:50:16,513 INFO L168 Benchmark]: Toolchain (without parser) took 4858.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:50:16,514 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:50:16,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:50:16,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:50:16,515 INFO L168 Benchmark]: Boogie Preprocessor took 71.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:50:16,515 INFO L168 Benchmark]: RCFGBuilder took 1490.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:50:16,516 INFO L168 Benchmark]: TraceAbstraction took 2735.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:50:16,516 INFO L168 Benchmark]: Witness Printer took 136.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:50:16,519 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -193.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1490.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 130.8 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2735.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 136.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 [L211] COND TRUE m_i == 1 [L212] m_st = 0 [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 [L324] COND FALSE !(M_E == 0) [L329] COND FALSE !(T1_E == 0) [L334] COND FALSE !(T2_E == 0) [L339] COND FALSE !(E_1 == 0) [L344] COND FALSE !(E_2 == 0) [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L181] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L357] COND FALSE !(M_E == 1) [L362] COND FALSE !(T1_E == 1) [L367] COND FALSE !(T2_E == 1) [L372] COND FALSE !(E_1 == 1) [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L261] COND TRUE 1 [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 [L181] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L53] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L162] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L181] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 [L99] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 88 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.6s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1960 SDtfs, 1153 SDslu, 1499 SDs, 0 SdLazy, 270 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1840occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 822 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 506 ConstructedInterpolants, 0 QuantifiedInterpolants, 42755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 92/92 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 incorrect! Received shutdown request...