./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer --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 Automizer --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-678e011 [2019-11-20 02:09:46,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:09:46,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:09:46,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:09:46,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:09:46,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:09:46,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:09:46,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:09:46,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:09:46,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:09:46,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:09:46,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:09:46,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:09:46,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:09:46,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:09:46,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:09:46,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:09:46,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:09:46,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:09:46,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:09:46,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:09:46,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:09:46,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:09:46,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:09:46,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:09:46,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:09:46,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:09:46,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:09:46,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:09:46,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:09:46,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:09:46,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:09:46,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:09:46,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:09:46,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:09:46,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:09:46,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:09:46,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:09:46,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:09:46,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:09:46,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:09:46,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:09:46,118 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:09:46,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:09:46,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:09:46,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:09:46,119 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:09:46,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:09:46,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:09:46,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:09:46,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:09:46,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:09:46,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:09:46,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:09:46,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:09:46,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:09:46,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:09:46,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:09:46,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:09:46,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:09:46,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:09:46,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:09:46,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:09:46,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:09:46,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:09:46,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer 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 -> Automizer 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-20 02:09:46,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:09:46,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:09:46,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:09:46,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:09:46,306 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:09:46,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-20 02:09:46,357 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/data/af8d044ca/05821b6e4bfd42d3921df0bc36911547/FLAG5a0c2b0d3 [2019-11-20 02:09:46,804 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:09:46,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-20 02:09:46,825 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/data/af8d044ca/05821b6e4bfd42d3921df0bc36911547/FLAG5a0c2b0d3 [2019-11-20 02:09:46,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/data/af8d044ca/05821b6e4bfd42d3921df0bc36911547 [2019-11-20 02:09:46,844 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:09:46,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:09:46,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:09:46,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:09:46,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:09:46,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:09:46" (1/1) ... [2019-11-20 02:09:46,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d0b965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:46, skipping insertion in model container [2019-11-20 02:09:46,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:09:46" (1/1) ... [2019-11-20 02:09:46,861 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:09:46,888 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:09:47,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:09:47,128 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:09:47,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:09:47,195 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:09:47,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47 WrapperNode [2019-11-20 02:09:47,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:09:47,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:09:47,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:09:47,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:09:47,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:09:47,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:09:47,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:09:47,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:09:47,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... [2019-11-20 02:09:47,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:09:47,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:09:47,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:09:47,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:09:47,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/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-20 02:09:47,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:09:47,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:09:48,046 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:09:48,047 INFO L285 CfgBuilder]: Removed 94 assume(true) statements. [2019-11-20 02:09:48,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:09:48 BoogieIcfgContainer [2019-11-20 02:09:48,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:09:48,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:09:48,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:09:48,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:09:48,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:09:46" (1/3) ... [2019-11-20 02:09:48,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d5262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:09:48, skipping insertion in model container [2019-11-20 02:09:48,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:09:47" (2/3) ... [2019-11-20 02:09:48,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d5262d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:09:48, skipping insertion in model container [2019-11-20 02:09:48,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:09:48" (3/3) ... [2019-11-20 02:09:48,055 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-20 02:09:48,065 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:09:48,071 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:09:48,081 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:09:48,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:09:48,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:09:48,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:09:48,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:09:48,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:09:48,104 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:09:48,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:09:48,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:09:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-20 02:09:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:48,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:48,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:48,130 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:48,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2019-11-20 02:09:48,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:48,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192777878] [2019-11-20 02:09:48,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:48,281 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-20 02:09:48,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192777878] [2019-11-20 02:09:48,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:48,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:48,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897373009] [2019-11-20 02:09:48,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:48,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:48,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:48,304 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2019-11-20 02:09:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:48,361 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2019-11-20 02:09:48,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:48,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:48,375 INFO L225 Difference]: With dead ends: 379 [2019-11-20 02:09:48,375 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:09:48,378 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-20 02:09:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:09:48,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-11-20 02:09:48,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-20 02:09:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2019-11-20 02:09:48,429 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2019-11-20 02:09:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:48,429 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2019-11-20 02:09:48,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2019-11-20 02:09:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:48,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:48,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:48,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:48,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2019-11-20 02:09:48,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:48,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839564189] [2019-11-20 02:09:48,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:48,475 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-20 02:09:48,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839564189] [2019-11-20 02:09:48,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:48,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:48,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125508821] [2019-11-20 02:09:48,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:48,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:48,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:48,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:48,478 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2019-11-20 02:09:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:48,575 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2019-11-20 02:09:48,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:48,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:48,578 INFO L225 Difference]: With dead ends: 498 [2019-11-20 02:09:48,579 INFO L226 Difference]: Without dead ends: 317 [2019-11-20 02:09:48,581 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-20 02:09:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-20 02:09:48,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2019-11-20 02:09:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 02:09:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2019-11-20 02:09:48,633 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2019-11-20 02:09:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:48,633 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2019-11-20 02:09:48,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:48,634 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2019-11-20 02:09:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:48,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:48,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:48,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2019-11-20 02:09:48,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:48,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118499677] [2019-11-20 02:09:48,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:48,681 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-20 02:09:48,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118499677] [2019-11-20 02:09:48,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:48,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:48,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930488342] [2019-11-20 02:09:48,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:48,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:48,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:48,684 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2019-11-20 02:09:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:48,715 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2019-11-20 02:09:48,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:48,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:48,719 INFO L225 Difference]: With dead ends: 622 [2019-11-20 02:09:48,719 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 02:09:48,721 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-20 02:09:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 02:09:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 02:09:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 02:09:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2019-11-20 02:09:48,744 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2019-11-20 02:09:48,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:48,744 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2019-11-20 02:09:48,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2019-11-20 02:09:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:48,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:48,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:48,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2019-11-20 02:09:48,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:48,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833561442] [2019-11-20 02:09:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:48,807 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-20 02:09:48,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833561442] [2019-11-20 02:09:48,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:48,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:48,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264183508] [2019-11-20 02:09:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:48,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:48,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:48,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:48,809 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2019-11-20 02:09:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:48,848 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2019-11-20 02:09:48,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:48,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:48,852 INFO L225 Difference]: With dead ends: 621 [2019-11-20 02:09:48,852 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 02:09:48,857 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-20 02:09:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 02:09:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 02:09:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 02:09:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2019-11-20 02:09:48,889 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2019-11-20 02:09:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:48,890 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2019-11-20 02:09:48,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2019-11-20 02:09:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:48,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:48,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:48,901 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2019-11-20 02:09:48,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:48,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640695731] [2019-11-20 02:09:48,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:48,965 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-20 02:09:48,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640695731] [2019-11-20 02:09:48,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:48,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:48,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271879836] [2019-11-20 02:09:48,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:48,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:48,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:48,967 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2019-11-20 02:09:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:49,037 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2019-11-20 02:09:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:49,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:49,040 INFO L225 Difference]: With dead ends: 620 [2019-11-20 02:09:49,040 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 02:09:49,041 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-20 02:09:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 02:09:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 02:09:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 02:09:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2019-11-20 02:09:49,056 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2019-11-20 02:09:49,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:49,056 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-11-20 02:09:49,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:49,056 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2019-11-20 02:09:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:49,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:49,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:49,058 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2019-11-20 02:09:49,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:49,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716411843] [2019-11-20 02:09:49,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:49,100 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-20 02:09:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716411843] [2019-11-20 02:09:49,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:49,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:49,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007647526] [2019-11-20 02:09:49,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:49,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:49,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:49,102 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2019-11-20 02:09:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:49,160 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2019-11-20 02:09:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:49,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:49,163 INFO L225 Difference]: With dead ends: 619 [2019-11-20 02:09:49,163 INFO L226 Difference]: Without dead ends: 315 [2019-11-20 02:09:49,164 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-20 02:09:49,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-20 02:09:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-20 02:09:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 02:09:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2019-11-20 02:09:49,182 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2019-11-20 02:09:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:49,182 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2019-11-20 02:09:49,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2019-11-20 02:09:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:09:49,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:49,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:49,184 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2019-11-20 02:09:49,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:49,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502588777] [2019-11-20 02:09:49,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:49,262 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-20 02:09:49,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502588777] [2019-11-20 02:09:49,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:49,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:49,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994980958] [2019-11-20 02:09:49,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:49,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:49,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:49,269 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 3 states. [2019-11-20 02:09:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:49,351 INFO L93 Difference]: Finished difference Result 870 states and 1162 transitions. [2019-11-20 02:09:49,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:49,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 02:09:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:49,356 INFO L225 Difference]: With dead ends: 870 [2019-11-20 02:09:49,356 INFO L226 Difference]: Without dead ends: 592 [2019-11-20 02:09:49,357 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-20 02:09:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-20 02:09:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 556. [2019-11-20 02:09:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-20 02:09:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2019-11-20 02:09:49,391 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 49 [2019-11-20 02:09:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:49,392 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2019-11-20 02:09:49,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2019-11-20 02:09:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 02:09:49,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:49,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:49,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash -397727545, now seen corresponding path program 1 times [2019-11-20 02:09:49,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:49,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839729078] [2019-11-20 02:09:49,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:49,466 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-20 02:09:49,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839729078] [2019-11-20 02:09:49,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:49,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:49,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593460459] [2019-11-20 02:09:49,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:49,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:49,469 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand 3 states. [2019-11-20 02:09:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:49,559 INFO L93 Difference]: Finished difference Result 1454 states and 1913 transitions. [2019-11-20 02:09:49,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:49,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-20 02:09:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:49,566 INFO L225 Difference]: With dead ends: 1454 [2019-11-20 02:09:49,567 INFO L226 Difference]: Without dead ends: 968 [2019-11-20 02:09:49,568 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-20 02:09:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-20 02:09:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2019-11-20 02:09:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-20 02:09:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1204 transitions. [2019-11-20 02:09:49,613 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1204 transitions. Word has length 50 [2019-11-20 02:09:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:49,614 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1204 transitions. [2019-11-20 02:09:49,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1204 transitions. [2019-11-20 02:09:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 02:09:49,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:49,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:49,615 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash 765911831, now seen corresponding path program 1 times [2019-11-20 02:09:49,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:49,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635231630] [2019-11-20 02:09:49,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:49,665 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-20 02:09:49,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635231630] [2019-11-20 02:09:49,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:49,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:09:49,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136628823] [2019-11-20 02:09:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:49,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:49,666 INFO L87 Difference]: Start difference. First operand 926 states and 1204 transitions. Second operand 3 states. [2019-11-20 02:09:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:49,781 INFO L93 Difference]: Finished difference Result 2626 states and 3421 transitions. [2019-11-20 02:09:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:49,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-20 02:09:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:49,792 INFO L225 Difference]: With dead ends: 2626 [2019-11-20 02:09:49,792 INFO L226 Difference]: Without dead ends: 1750 [2019-11-20 02:09:49,794 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-20 02:09:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-11-20 02:09:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1734. [2019-11-20 02:09:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-11-20 02:09:49,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2234 transitions. [2019-11-20 02:09:49,920 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2234 transitions. Word has length 51 [2019-11-20 02:09:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:49,920 INFO L462 AbstractCegarLoop]: Abstraction has 1734 states and 2234 transitions. [2019-11-20 02:09:49,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2234 transitions. [2019-11-20 02:09:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 02:09:49,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:49,922 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:49,922 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1533277321, now seen corresponding path program 1 times [2019-11-20 02:09:49,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:49,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976362814] [2019-11-20 02:09:49,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:09:49,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976362814] [2019-11-20 02:09:49,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:49,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:49,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368768923] [2019-11-20 02:09:49,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:49,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:49,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:49,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:49,971 INFO L87 Difference]: Start difference. First operand 1734 states and 2234 transitions. Second operand 3 states. [2019-11-20 02:09:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:50,135 INFO L93 Difference]: Finished difference Result 5068 states and 6521 transitions. [2019-11-20 02:09:50,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:50,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 02:09:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:50,156 INFO L225 Difference]: With dead ends: 5068 [2019-11-20 02:09:50,156 INFO L226 Difference]: Without dead ends: 3402 [2019-11-20 02:09:50,159 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-20 02:09:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-20 02:09:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2019-11-20 02:09:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2019-11-20 02:09:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4340 transitions. [2019-11-20 02:09:50,306 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4340 transitions. Word has length 66 [2019-11-20 02:09:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:50,309 INFO L462 AbstractCegarLoop]: Abstraction has 3402 states and 4340 transitions. [2019-11-20 02:09:50,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4340 transitions. [2019-11-20 02:09:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:09:50,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:50,313 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:50,313 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:50,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:50,314 INFO L82 PathProgramCache]: Analyzing trace with hash -883662481, now seen corresponding path program 1 times [2019-11-20 02:09:50,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:50,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719081499] [2019-11-20 02:09:50,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 02:09:50,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719081499] [2019-11-20 02:09:50,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:50,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:09:50,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519802359] [2019-11-20 02:09:50,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:09:50,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:50,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:09:50,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:09:50,385 INFO L87 Difference]: Start difference. First operand 3402 states and 4340 transitions. Second operand 5 states. [2019-11-20 02:09:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:50,788 INFO L93 Difference]: Finished difference Result 10802 states and 13699 transitions. [2019-11-20 02:09:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:09:50,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-20 02:09:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:50,828 INFO L225 Difference]: With dead ends: 10802 [2019-11-20 02:09:50,828 INFO L226 Difference]: Without dead ends: 7492 [2019-11-20 02:09:50,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:09:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-11-20 02:09:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 3546. [2019-11-20 02:09:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-11-20 02:09:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4448 transitions. [2019-11-20 02:09:51,133 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4448 transitions. Word has length 89 [2019-11-20 02:09:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:51,134 INFO L462 AbstractCegarLoop]: Abstraction has 3546 states and 4448 transitions. [2019-11-20 02:09:51,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:09:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4448 transitions. [2019-11-20 02:09:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:09:51,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:51,138 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:51,138 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -305176077, now seen corresponding path program 1 times [2019-11-20 02:09:51,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:51,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196401666] [2019-11-20 02:09:51,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 02:09:51,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196401666] [2019-11-20 02:09:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699590261] [2019-11-20 02:09:51,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:51,193 INFO L87 Difference]: Start difference. First operand 3546 states and 4448 transitions. Second operand 3 states. [2019-11-20 02:09:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:51,523 INFO L93 Difference]: Finished difference Result 10194 states and 12806 transitions. [2019-11-20 02:09:51,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:51,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 02:09:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:51,561 INFO L225 Difference]: With dead ends: 10194 [2019-11-20 02:09:51,561 INFO L226 Difference]: Without dead ends: 6712 [2019-11-20 02:09:51,567 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-20 02:09:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-20 02:09:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6494. [2019-11-20 02:09:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-11-20 02:09:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8084 transitions. [2019-11-20 02:09:51,909 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8084 transitions. Word has length 89 [2019-11-20 02:09:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:51,910 INFO L462 AbstractCegarLoop]: Abstraction has 6494 states and 8084 transitions. [2019-11-20 02:09:51,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8084 transitions. [2019-11-20 02:09:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:09:51,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:51,915 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:51,915 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:51,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1278665036, now seen corresponding path program 1 times [2019-11-20 02:09:51,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:51,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379255935] [2019-11-20 02:09:51,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 02:09:51,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379255935] [2019-11-20 02:09:51,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:51,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:09:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031133974] [2019-11-20 02:09:51,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:09:51,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:09:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:09:51,971 INFO L87 Difference]: Start difference. First operand 6494 states and 8084 transitions. Second operand 5 states. [2019-11-20 02:09:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:52,585 INFO L93 Difference]: Finished difference Result 15348 states and 19199 transitions. [2019-11-20 02:09:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:09:52,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-20 02:09:52,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:52,636 INFO L225 Difference]: With dead ends: 15348 [2019-11-20 02:09:52,637 INFO L226 Difference]: Without dead ends: 8934 [2019-11-20 02:09:52,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:09:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2019-11-20 02:09:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 6542. [2019-11-20 02:09:53,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-20 02:09:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8000 transitions. [2019-11-20 02:09:53,017 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8000 transitions. Word has length 89 [2019-11-20 02:09:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:53,017 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 8000 transitions. [2019-11-20 02:09:53,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:09:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8000 transitions. [2019-11-20 02:09:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:09:53,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:53,024 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:53,024 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash 211800632, now seen corresponding path program 1 times [2019-11-20 02:09:53,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:53,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314854356] [2019-11-20 02:09:53,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:09:53,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314854356] [2019-11-20 02:09:53,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:53,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:53,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873069257] [2019-11-20 02:09:53,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:53,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:53,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:53,087 INFO L87 Difference]: Start difference. First operand 6542 states and 8000 transitions. Second operand 3 states. [2019-11-20 02:09:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:53,373 INFO L93 Difference]: Finished difference Result 9812 states and 12049 transitions. [2019-11-20 02:09:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:53,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-20 02:09:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:53,386 INFO L225 Difference]: With dead ends: 9812 [2019-11-20 02:09:53,386 INFO L226 Difference]: Without dead ends: 6542 [2019-11-20 02:09:53,392 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-20 02:09:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2019-11-20 02:09:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 6512. [2019-11-20 02:09:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-11-20 02:09:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7866 transitions. [2019-11-20 02:09:53,745 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7866 transitions. Word has length 89 [2019-11-20 02:09:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:53,746 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 7866 transitions. [2019-11-20 02:09:53,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7866 transitions. [2019-11-20 02:09:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 02:09:53,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:53,750 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:53,751 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash -974468191, now seen corresponding path program 1 times [2019-11-20 02:09:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:53,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093779896] [2019-11-20 02:09:53,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 02:09:53,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093779896] [2019-11-20 02:09:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:53,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:09:53,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152343603] [2019-11-20 02:09:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:09:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:09:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:09:53,812 INFO L87 Difference]: Start difference. First operand 6512 states and 7866 transitions. Second operand 5 states. [2019-11-20 02:09:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:54,223 INFO L93 Difference]: Finished difference Result 12634 states and 15323 transitions. [2019-11-20 02:09:54,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:09:54,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-20 02:09:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:54,234 INFO L225 Difference]: With dead ends: 12634 [2019-11-20 02:09:54,235 INFO L226 Difference]: Without dead ends: 6178 [2019-11-20 02:09:54,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:09:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-11-20 02:09:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4920. [2019-11-20 02:09:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2019-11-20 02:09:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5854 transitions. [2019-11-20 02:09:54,511 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5854 transitions. Word has length 90 [2019-11-20 02:09:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:54,511 INFO L462 AbstractCegarLoop]: Abstraction has 4920 states and 5854 transitions. [2019-11-20 02:09:54,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:09:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5854 transitions. [2019-11-20 02:09:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 02:09:54,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:54,515 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:54,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2019-11-20 02:09:54,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:54,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434735830] [2019-11-20 02:09:54,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:09:54,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434735830] [2019-11-20 02:09:54,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:54,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:54,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036956629] [2019-11-20 02:09:54,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:54,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:54,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:54,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:54,560 INFO L87 Difference]: Start difference. First operand 4920 states and 5854 transitions. Second operand 3 states. [2019-11-20 02:09:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:54,870 INFO L93 Difference]: Finished difference Result 9778 states and 11642 transitions. [2019-11-20 02:09:54,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:54,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-20 02:09:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:54,877 INFO L225 Difference]: With dead ends: 9778 [2019-11-20 02:09:54,877 INFO L226 Difference]: Without dead ends: 4190 [2019-11-20 02:09:54,883 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-20 02:09:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-20 02:09:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4186. [2019-11-20 02:09:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-11-20 02:09:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4930 transitions. [2019-11-20 02:09:55,088 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4930 transitions. Word has length 92 [2019-11-20 02:09:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:55,088 INFO L462 AbstractCegarLoop]: Abstraction has 4186 states and 4930 transitions. [2019-11-20 02:09:55,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4930 transitions. [2019-11-20 02:09:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 02:09:55,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:55,092 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:55,092 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:55,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2019-11-20 02:09:55,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:55,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425991716] [2019-11-20 02:09:55,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 02:09:55,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425991716] [2019-11-20 02:09:55,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:55,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:55,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337834535] [2019-11-20 02:09:55,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:55,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:55,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:55,131 INFO L87 Difference]: Start difference. First operand 4186 states and 4930 transitions. Second operand 3 states. [2019-11-20 02:09:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:55,358 INFO L93 Difference]: Finished difference Result 8752 states and 10233 transitions. [2019-11-20 02:09:55,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:55,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 02:09:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:55,364 INFO L225 Difference]: With dead ends: 8752 [2019-11-20 02:09:55,364 INFO L226 Difference]: Without dead ends: 2868 [2019-11-20 02:09:55,371 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-20 02:09:55,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-11-20 02:09:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2790. [2019-11-20 02:09:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-11-20 02:09:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3146 transitions. [2019-11-20 02:09:55,510 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3146 transitions. Word has length 116 [2019-11-20 02:09:55,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:55,510 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 3146 transitions. [2019-11-20 02:09:55,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3146 transitions. [2019-11-20 02:09:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 02:09:55,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:55,514 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:55,514 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2019-11-20 02:09:55,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:55,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304458735] [2019-11-20 02:09:55,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:09:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:09:55,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304458735] [2019-11-20 02:09:55,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:09:55,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:09:55,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866583272] [2019-11-20 02:09:55,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:09:55,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:09:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:09:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:09:55,559 INFO L87 Difference]: Start difference. First operand 2790 states and 3146 transitions. Second operand 3 states. [2019-11-20 02:09:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:09:55,685 INFO L93 Difference]: Finished difference Result 3172 states and 3583 transitions. [2019-11-20 02:09:55,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:09:55,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-20 02:09:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:09:55,690 INFO L225 Difference]: With dead ends: 3172 [2019-11-20 02:09:55,690 INFO L226 Difference]: Without dead ends: 2470 [2019-11-20 02:09:55,692 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-20 02:09:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-20 02:09:55,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2019-11-20 02:09:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-20 02:09:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2766 transitions. [2019-11-20 02:09:55,855 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2766 transitions. Word has length 117 [2019-11-20 02:09:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:09:55,856 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 2766 transitions. [2019-11-20 02:09:55,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:09:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2766 transitions. [2019-11-20 02:09:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 02:09:55,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:09:55,859 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:09:55,859 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:09:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:09:55,860 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2019-11-20 02:09:55,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:09:55,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245944671] [2019-11-20 02:09:55,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:09:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:09:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:09:55,933 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:09:55,933 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:09:56,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:09:56 BoogieIcfgContainer [2019-11-20 02:09:56,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:09:56,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:09:56,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:09:56,064 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:09:56,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:09:48" (3/4) ... [2019-11-20 02:09:56,067 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 02:09:56,190 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6a7848ef-c776-493e-958d-9bf922c056c2/bin/uautomizer/witness.graphml [2019-11-20 02:09:56,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:09:56,192 INFO L168 Benchmark]: Toolchain (without parser) took 9346.48 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 779.6 MB). Free memory was 951.5 MB in the beginning and 1.7 GB in the end (delta: -754.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:09:56,194 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:09:56,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 951.5 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:09:56,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:09:56,195 INFO L168 Benchmark]: Boogie Preprocessor took 38.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:09:56,196 INFO L168 Benchmark]: RCFGBuilder took 761.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:09:56,196 INFO L168 Benchmark]: TraceAbstraction took 8013.43 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 614.5 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -634.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:09:56,196 INFO L168 Benchmark]: Witness Printer took 127.19 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:09:56,199 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 951.5 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 761.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8013.43 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 614.5 MB). Free memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: -634.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 127.19 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 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; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 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] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 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] [L211] COND TRUE m_i == 1 [L212] m_st = 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] [L216] COND TRUE t1_i == 1 [L217] t1_st = 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] [L221] COND TRUE t2_i == 1 [L222] t2_st = 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] [L324] COND FALSE !(M_E == 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] [L329] COND FALSE !(T1_E == 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] [L334] COND FALSE !(T2_E == 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] [L339] COND FALSE !(E_1 == 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] [L344] COND FALSE !(E_2 == 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] [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); 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] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\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] [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); 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] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___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] [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); 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] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___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] [L357] COND FALSE !(M_E == 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] [L362] COND FALSE !(T1_E == 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] [L367] COND FALSE !(T2_E == 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] [L372] COND FALSE !(E_1 == 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] [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 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] [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 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] [L231] 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] [L234] COND TRUE m_st == 0 [L235] __retres1 = 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] [L252] return (__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] [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 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] [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 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] [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 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] [L231] 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=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 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=1, t2_st=2] [L252] return (__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=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [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 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] [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); 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] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) 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] [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); 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] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 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] [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); 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] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___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] [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 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] [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 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] [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); 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] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) 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] [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); 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] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___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] [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); 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] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 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=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 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] [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, 192 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.9s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5274 SDtfs, 4949 SDslu, 4000 SDs, 0 SdLazy, 329 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6542occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 8022 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 148665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 126/126 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...