./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/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 c3ad6b5f7a86e93f1481cfc1ff0dfd89486f281f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-10-22 09:02:49,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:49,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:49,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:49,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:49,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:49,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:49,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:49,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:49,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:49,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:49,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:49,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:49,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:49,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:49,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:49,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:49,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:49,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:49,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:49,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:49,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:49,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:49,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:49,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:49,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:49,499 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:49,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:49,500 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:49,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:49,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:49,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:49,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:49,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:49,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:49,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:49,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:49,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:49,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:49,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:49,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:49,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:49,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:49,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:49,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:49,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:49,534 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:49,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:49,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:49,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:49,536 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:49,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:49,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:49,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:49,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:49,537 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:49,537 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:49,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:49,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:49,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:49,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:49,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:49,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:49,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:49,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:49,540 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/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/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 -> c3ad6b5f7a86e93f1481cfc1ff0dfd89486f281f [2019-10-22 09:02:49,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:49,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:49,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:49,590 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:49,591 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:49,591 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-10-22 09:02:49,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/data/ae4d037d4/9bf4762e36ae4c459223efaaef6876d1/FLAG3526f98cd [2019-10-22 09:02:50,064 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:50,064 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-10-22 09:02:50,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/data/ae4d037d4/9bf4762e36ae4c459223efaaef6876d1/FLAG3526f98cd [2019-10-22 09:02:50,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/data/ae4d037d4/9bf4762e36ae4c459223efaaef6876d1 [2019-10-22 09:02:50,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:50,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:50,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:50,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:50,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:50,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bf6310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50, skipping insertion in model container [2019-10-22 09:02:50,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,104 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:50,138 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:50,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:50,506 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:50,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:50,660 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:50,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50 WrapperNode [2019-10-22 09:02:50,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:50,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:50,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:50,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:50,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:50,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:50,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:50,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:50,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... [2019-10-22 09:02:50,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:50,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:50,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:50,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:50,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/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-10-22 09:02:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 09:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 09:02:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 09:02:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 09:02:50,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 09:02:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 09:02:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:50,817 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 09:02:51,374 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:51,374 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:02:51,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51 BoogieIcfgContainer [2019-10-22 09:02:51,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:51,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:51,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:51,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:51,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:50" (1/3) ... [2019-10-22 09:02:51,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da2daa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:51, skipping insertion in model container [2019-10-22 09:02:51,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:50" (2/3) ... [2019-10-22 09:02:51,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da2daa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:51, skipping insertion in model container [2019-10-22 09:02:51,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51" (3/3) ... [2019-10-22 09:02:51,382 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc.i [2019-10-22 09:02:51,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,416 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,416 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,417 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,417 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,418 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,419 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,434 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,435 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,436 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,437 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,438 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,439 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,439 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,439 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,439 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,439 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,440 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,441 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,442 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,443 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,446 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,447 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,447 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,447 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,447 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,448 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,449 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,449 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,449 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,449 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,449 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,450 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,451 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,451 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,451 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,451 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,451 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,452 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:02:51,457 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:02:51,457 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:51,471 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 09:02:51,497 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 09:02:51,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:51,521 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:51,521 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:51,521 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:51,521 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:51,521 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:51,521 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:51,522 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:51,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 161 transitions [2019-10-22 09:02:53,672 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27853 states. [2019-10-22 09:02:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 27853 states. [2019-10-22 09:02:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:02:53,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:53,687 INFO L380 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] [2019-10-22 09:02:53,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1948189748, now seen corresponding path program 1 times [2019-10-22 09:02:53,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:53,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783487401] [2019-10-22 09:02:53,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:53,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:53,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783487401] [2019-10-22 09:02:53,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:53,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:53,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152423199] [2019-10-22 09:02:53,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:53,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:54,011 INFO L87 Difference]: Start difference. First operand 27853 states. Second operand 4 states. [2019-10-22 09:02:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:54,590 INFO L93 Difference]: Finished difference Result 28521 states and 108878 transitions. [2019-10-22 09:02:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:54,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-22 09:02:54,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:54,797 INFO L225 Difference]: With dead ends: 28521 [2019-10-22 09:02:54,798 INFO L226 Difference]: Without dead ends: 21753 [2019-10-22 09:02:54,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21753 states. [2019-10-22 09:02:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21753 to 21753. [2019-10-22 09:02:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21753 states. [2019-10-22 09:02:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 83438 transitions. [2019-10-22 09:02:55,865 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 83438 transitions. Word has length 36 [2019-10-22 09:02:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:55,866 INFO L462 AbstractCegarLoop]: Abstraction has 21753 states and 83438 transitions. [2019-10-22 09:02:55,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 83438 transitions. [2019-10-22 09:02:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:55,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:55,875 INFO L380 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] [2019-10-22 09:02:55,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:55,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2084779232, now seen corresponding path program 1 times [2019-10-22 09:02:55,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:55,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758901378] [2019-10-22 09:02:55,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:55,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:55,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758901378] [2019-10-22 09:02:55,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:55,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:55,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115258558] [2019-10-22 09:02:56,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:56,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:56,004 INFO L87 Difference]: Start difference. First operand 21753 states and 83438 transitions. Second operand 5 states. [2019-10-22 09:02:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:56,907 INFO L93 Difference]: Finished difference Result 34167 states and 124038 transitions. [2019-10-22 09:02:56,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:56,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 09:02:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:57,351 INFO L225 Difference]: With dead ends: 34167 [2019-10-22 09:02:57,351 INFO L226 Difference]: Without dead ends: 33599 [2019-10-22 09:02:57,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33599 states. [2019-10-22 09:02:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33599 to 31793. [2019-10-22 09:02:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31793 states. [2019-10-22 09:02:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31793 states to 31793 states and 116816 transitions. [2019-10-22 09:02:58,303 INFO L78 Accepts]: Start accepts. Automaton has 31793 states and 116816 transitions. Word has length 44 [2019-10-22 09:02:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:58,304 INFO L462 AbstractCegarLoop]: Abstraction has 31793 states and 116816 transitions. [2019-10-22 09:02:58,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 31793 states and 116816 transitions. [2019-10-22 09:02:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:02:58,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:58,309 INFO L380 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] [2019-10-22 09:02:58,309 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:58,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash -813435401, now seen corresponding path program 1 times [2019-10-22 09:02:58,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722690067] [2019-10-22 09:02:58,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:58,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722690067] [2019-10-22 09:02:58,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:58,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:58,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467188216] [2019-10-22 09:02:58,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:58,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:58,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:58,405 INFO L87 Difference]: Start difference. First operand 31793 states and 116816 transitions. Second operand 5 states. [2019-10-22 09:02:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:59,147 INFO L93 Difference]: Finished difference Result 41641 states and 149740 transitions. [2019-10-22 09:02:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:59,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 09:02:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:59,297 INFO L225 Difference]: With dead ends: 41641 [2019-10-22 09:02:59,297 INFO L226 Difference]: Without dead ends: 41177 [2019-10-22 09:02:59,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41177 states. [2019-10-22 09:03:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41177 to 35361. [2019-10-22 09:03:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35361 states. [2019-10-22 09:03:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35361 states to 35361 states and 128874 transitions. [2019-10-22 09:03:00,334 INFO L78 Accepts]: Start accepts. Automaton has 35361 states and 128874 transitions. Word has length 45 [2019-10-22 09:03:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:00,335 INFO L462 AbstractCegarLoop]: Abstraction has 35361 states and 128874 transitions. [2019-10-22 09:03:00,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 35361 states and 128874 transitions. [2019-10-22 09:03:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:03:00,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:00,344 INFO L380 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] [2019-10-22 09:03:00,344 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1323257433, now seen corresponding path program 1 times [2019-10-22 09:03:00,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091703981] [2019-10-22 09:03:00,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:00,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091703981] [2019-10-22 09:03:00,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:00,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:00,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532363593] [2019-10-22 09:03:00,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:00,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:00,383 INFO L87 Difference]: Start difference. First operand 35361 states and 128874 transitions. Second operand 3 states. [2019-10-22 09:03:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:01,009 INFO L93 Difference]: Finished difference Result 45907 states and 163942 transitions. [2019-10-22 09:03:01,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:01,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 09:03:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:01,132 INFO L225 Difference]: With dead ends: 45907 [2019-10-22 09:03:01,133 INFO L226 Difference]: Without dead ends: 45907 [2019-10-22 09:03:01,133 INFO L600 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-10-22 09:03:01,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45907 states. [2019-10-22 09:03:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45907 to 40244. [2019-10-22 09:03:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40244 states. [2019-10-22 09:03:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40244 states to 40244 states and 145212 transitions. [2019-10-22 09:03:01,941 INFO L78 Accepts]: Start accepts. Automaton has 40244 states and 145212 transitions. Word has length 47 [2019-10-22 09:03:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:01,942 INFO L462 AbstractCegarLoop]: Abstraction has 40244 states and 145212 transitions. [2019-10-22 09:03:01,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 40244 states and 145212 transitions. [2019-10-22 09:03:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:03:01,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:01,953 INFO L380 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-10-22 09:03:01,953 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash 598320720, now seen corresponding path program 1 times [2019-10-22 09:03:01,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650175719] [2019-10-22 09:03:01,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650175719] [2019-10-22 09:03:02,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:02,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:02,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080543378] [2019-10-22 09:03:02,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:02,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:02,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:02,024 INFO L87 Difference]: Start difference. First operand 40244 states and 145212 transitions. Second operand 6 states. [2019-10-22 09:03:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,998 INFO L93 Difference]: Finished difference Result 52463 states and 185474 transitions. [2019-10-22 09:03:02,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:03:02,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:03:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:03,115 INFO L225 Difference]: With dead ends: 52463 [2019-10-22 09:03:03,115 INFO L226 Difference]: Without dead ends: 51927 [2019-10-22 09:03:03,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51927 states. [2019-10-22 09:03:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51927 to 40895. [2019-10-22 09:03:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40895 states. [2019-10-22 09:03:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40895 states to 40895 states and 147665 transitions. [2019-10-22 09:03:03,957 INFO L78 Accepts]: Start accepts. Automaton has 40895 states and 147665 transitions. Word has length 51 [2019-10-22 09:03:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:03,958 INFO L462 AbstractCegarLoop]: Abstraction has 40895 states and 147665 transitions. [2019-10-22 09:03:03,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40895 states and 147665 transitions. [2019-10-22 09:03:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:03:03,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:03,972 INFO L380 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-10-22 09:03:03,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1930460229, now seen corresponding path program 1 times [2019-10-22 09:03:03,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942347318] [2019-10-22 09:03:03,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942347318] [2019-10-22 09:03:04,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:04,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:04,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712896920] [2019-10-22 09:03:04,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:04,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:04,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:04,064 INFO L87 Difference]: Start difference. First operand 40895 states and 147665 transitions. Second operand 6 states. [2019-10-22 09:03:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:04,684 INFO L93 Difference]: Finished difference Result 56596 states and 201645 transitions. [2019-10-22 09:03:04,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:04,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:03:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:04,786 INFO L225 Difference]: With dead ends: 56596 [2019-10-22 09:03:04,786 INFO L226 Difference]: Without dead ends: 55457 [2019-10-22 09:03:04,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:04,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55457 states. [2019-10-22 09:03:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55457 to 51952. [2019-10-22 09:03:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51952 states. [2019-10-22 09:03:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51952 states to 51952 states and 186004 transitions. [2019-10-22 09:03:06,095 INFO L78 Accepts]: Start accepts. Automaton has 51952 states and 186004 transitions. Word has length 51 [2019-10-22 09:03:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,095 INFO L462 AbstractCegarLoop]: Abstraction has 51952 states and 186004 transitions. [2019-10-22 09:03:06,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 51952 states and 186004 transitions. [2019-10-22 09:03:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:03:06,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:06,110 INFO L380 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-10-22 09:03:06,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash 567555708, now seen corresponding path program 1 times [2019-10-22 09:03:06,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:06,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771773312] [2019-10-22 09:03:06,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:06,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:06,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771773312] [2019-10-22 09:03:06,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:06,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:06,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191470168] [2019-10-22 09:03:06,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:06,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:06,213 INFO L87 Difference]: Start difference. First operand 51952 states and 186004 transitions. Second operand 7 states. [2019-10-22 09:03:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:07,078 INFO L93 Difference]: Finished difference Result 75635 states and 260101 transitions. [2019-10-22 09:03:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:03:07,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-22 09:03:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:07,214 INFO L225 Difference]: With dead ends: 75635 [2019-10-22 09:03:07,215 INFO L226 Difference]: Without dead ends: 75635 [2019-10-22 09:03:07,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:03:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75635 states. [2019-10-22 09:03:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75635 to 61470. [2019-10-22 09:03:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61470 states. [2019-10-22 09:03:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61470 states to 61470 states and 215181 transitions. [2019-10-22 09:03:08,863 INFO L78 Accepts]: Start accepts. Automaton has 61470 states and 215181 transitions. Word has length 51 [2019-10-22 09:03:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:08,864 INFO L462 AbstractCegarLoop]: Abstraction has 61470 states and 215181 transitions. [2019-10-22 09:03:08,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 61470 states and 215181 transitions. [2019-10-22 09:03:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:03:08,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:08,874 INFO L380 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-10-22 09:03:08,874 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1455059389, now seen corresponding path program 1 times [2019-10-22 09:03:08,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:08,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794603709] [2019-10-22 09:03:08,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,875 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:08,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:08,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794603709] [2019-10-22 09:03:08,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:08,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:08,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825722700] [2019-10-22 09:03:08,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:08,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:08,969 INFO L87 Difference]: Start difference. First operand 61470 states and 215181 transitions. Second operand 5 states. [2019-10-22 09:03:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:09,055 INFO L93 Difference]: Finished difference Result 13775 states and 43271 transitions. [2019-10-22 09:03:09,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:09,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-22 09:03:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:09,069 INFO L225 Difference]: With dead ends: 13775 [2019-10-22 09:03:09,069 INFO L226 Difference]: Without dead ends: 12158 [2019-10-22 09:03:09,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12158 states. [2019-10-22 09:03:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12158 to 12110. [2019-10-22 09:03:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12110 states. [2019-10-22 09:03:09,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12110 states to 12110 states and 37955 transitions. [2019-10-22 09:03:09,194 INFO L78 Accepts]: Start accepts. Automaton has 12110 states and 37955 transitions. Word has length 51 [2019-10-22 09:03:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:09,194 INFO L462 AbstractCegarLoop]: Abstraction has 12110 states and 37955 transitions. [2019-10-22 09:03:09,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 12110 states and 37955 transitions. [2019-10-22 09:03:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:03:09,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:09,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:09,198 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:09,199 INFO L82 PathProgramCache]: Analyzing trace with hash 911252639, now seen corresponding path program 1 times [2019-10-22 09:03:09,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:09,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524968968] [2019-10-22 09:03:09,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:09,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524968968] [2019-10-22 09:03:09,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:09,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795561821] [2019-10-22 09:03:09,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:09,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:09,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:09,266 INFO L87 Difference]: Start difference. First operand 12110 states and 37955 transitions. Second operand 4 states. [2019-10-22 09:03:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:09,401 INFO L93 Difference]: Finished difference Result 14273 states and 44578 transitions. [2019-10-22 09:03:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:09,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-22 09:03:09,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:09,425 INFO L225 Difference]: With dead ends: 14273 [2019-10-22 09:03:09,425 INFO L226 Difference]: Without dead ends: 14273 [2019-10-22 09:03:09,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:09,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2019-10-22 09:03:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 12841. [2019-10-22 09:03:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12841 states. [2019-10-22 09:03:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12841 states to 12841 states and 40180 transitions. [2019-10-22 09:03:09,587 INFO L78 Accepts]: Start accepts. Automaton has 12841 states and 40180 transitions. Word has length 61 [2019-10-22 09:03:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:09,587 INFO L462 AbstractCegarLoop]: Abstraction has 12841 states and 40180 transitions. [2019-10-22 09:03:09,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 12841 states and 40180 transitions. [2019-10-22 09:03:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-22 09:03:09,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:09,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:09,592 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1640904322, now seen corresponding path program 1 times [2019-10-22 09:03:09,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:09,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077790616] [2019-10-22 09:03:09,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:09,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077790616] [2019-10-22 09:03:09,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:09,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555998343] [2019-10-22 09:03:09,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:09,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:09,702 INFO L87 Difference]: Start difference. First operand 12841 states and 40180 transitions. Second operand 6 states. [2019-10-22 09:03:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,104 INFO L93 Difference]: Finished difference Result 16767 states and 51609 transitions. [2019-10-22 09:03:10,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:03:10,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-10-22 09:03:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,123 INFO L225 Difference]: With dead ends: 16767 [2019-10-22 09:03:10,123 INFO L226 Difference]: Without dead ends: 16703 [2019-10-22 09:03:10,124 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16703 states. [2019-10-22 09:03:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16703 to 13810. [2019-10-22 09:03:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13810 states. [2019-10-22 09:03:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13810 states to 13810 states and 42964 transitions. [2019-10-22 09:03:10,289 INFO L78 Accepts]: Start accepts. Automaton has 13810 states and 42964 transitions. Word has length 61 [2019-10-22 09:03:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,290 INFO L462 AbstractCegarLoop]: Abstraction has 13810 states and 42964 transitions. [2019-10-22 09:03:10,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13810 states and 42964 transitions. [2019-10-22 09:03:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:10,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,295 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,295 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1008220767, now seen corresponding path program 1 times [2019-10-22 09:03:10,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355025199] [2019-10-22 09:03:10,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:10,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355025199] [2019-10-22 09:03:10,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:10,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:10,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330709406] [2019-10-22 09:03:10,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:10,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:10,350 INFO L87 Difference]: Start difference. First operand 13810 states and 42964 transitions. Second operand 4 states. [2019-10-22 09:03:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,544 INFO L93 Difference]: Finished difference Result 17357 states and 53253 transitions. [2019-10-22 09:03:10,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:10,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:03:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,564 INFO L225 Difference]: With dead ends: 17357 [2019-10-22 09:03:10,564 INFO L226 Difference]: Without dead ends: 17357 [2019-10-22 09:03:10,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17357 states. [2019-10-22 09:03:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17357 to 15781. [2019-10-22 09:03:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15781 states. [2019-10-22 09:03:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15781 states to 15781 states and 48576 transitions. [2019-10-22 09:03:10,740 INFO L78 Accepts]: Start accepts. Automaton has 15781 states and 48576 transitions. Word has length 63 [2019-10-22 09:03:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:10,740 INFO L462 AbstractCegarLoop]: Abstraction has 15781 states and 48576 transitions. [2019-10-22 09:03:10,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:10,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15781 states and 48576 transitions. [2019-10-22 09:03:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:10,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:10,747 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:10,747 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1209537186, now seen corresponding path program 1 times [2019-10-22 09:03:10,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:10,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529626425] [2019-10-22 09:03:10,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:10,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:10,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529626425] [2019-10-22 09:03:10,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:10,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:10,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198778623] [2019-10-22 09:03:10,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:10,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:10,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:10,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:10,792 INFO L87 Difference]: Start difference. First operand 15781 states and 48576 transitions. Second operand 3 states. [2019-10-22 09:03:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:10,952 INFO L93 Difference]: Finished difference Result 16411 states and 50316 transitions. [2019-10-22 09:03:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:10,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 09:03:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,970 INFO L225 Difference]: With dead ends: 16411 [2019-10-22 09:03:10,970 INFO L226 Difference]: Without dead ends: 16411 [2019-10-22 09:03:10,971 INFO L600 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-10-22 09:03:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16411 states. [2019-10-22 09:03:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16411 to 16123. [2019-10-22 09:03:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16123 states. [2019-10-22 09:03:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16123 states to 16123 states and 49514 transitions. [2019-10-22 09:03:11,143 INFO L78 Accepts]: Start accepts. Automaton has 16123 states and 49514 transitions. Word has length 63 [2019-10-22 09:03:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,143 INFO L462 AbstractCegarLoop]: Abstraction has 16123 states and 49514 transitions. [2019-10-22 09:03:11,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16123 states and 49514 transitions. [2019-10-22 09:03:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:11,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,152 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:11,152 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 844233709, now seen corresponding path program 1 times [2019-10-22 09:03:11,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131269271] [2019-10-22 09:03:11,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:11,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131269271] [2019-10-22 09:03:11,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:11,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81178787] [2019-10-22 09:03:11,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:11,260 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:11,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:11,261 INFO L87 Difference]: Start difference. First operand 16123 states and 49514 transitions. Second operand 6 states. [2019-10-22 09:03:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:11,660 INFO L93 Difference]: Finished difference Result 17575 states and 53333 transitions. [2019-10-22 09:03:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:11,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 09:03:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:11,680 INFO L225 Difference]: With dead ends: 17575 [2019-10-22 09:03:11,680 INFO L226 Difference]: Without dead ends: 17575 [2019-10-22 09:03:11,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:11,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17575 states. [2019-10-22 09:03:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17575 to 17006. [2019-10-22 09:03:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17006 states. [2019-10-22 09:03:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 51780 transitions. [2019-10-22 09:03:11,858 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 51780 transitions. Word has length 65 [2019-10-22 09:03:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 17006 states and 51780 transitions. [2019-10-22 09:03:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 51780 transitions. [2019-10-22 09:03:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:11,868 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,868 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:11,868 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1232975634, now seen corresponding path program 1 times [2019-10-22 09:03:11,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183320924] [2019-10-22 09:03:11,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:11,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183320924] [2019-10-22 09:03:11,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:11,955 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709645820] [2019-10-22 09:03:11,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:11,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:11,956 INFO L87 Difference]: Start difference. First operand 17006 states and 51780 transitions. Second operand 6 states. [2019-10-22 09:03:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:12,237 INFO L93 Difference]: Finished difference Result 19871 states and 58890 transitions. [2019-10-22 09:03:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:03:12,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 09:03:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:12,258 INFO L225 Difference]: With dead ends: 19871 [2019-10-22 09:03:12,258 INFO L226 Difference]: Without dead ends: 19871 [2019-10-22 09:03:12,258 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:03:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19871 states. [2019-10-22 09:03:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19871 to 17682. [2019-10-22 09:03:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17682 states. [2019-10-22 09:03:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17682 states to 17682 states and 52846 transitions. [2019-10-22 09:03:12,457 INFO L78 Accepts]: Start accepts. Automaton has 17682 states and 52846 transitions. Word has length 65 [2019-10-22 09:03:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:12,457 INFO L462 AbstractCegarLoop]: Abstraction has 17682 states and 52846 transitions. [2019-10-22 09:03:12,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 17682 states and 52846 transitions. [2019-10-22 09:03:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:12,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:12,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:12,469 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:12,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1021624721, now seen corresponding path program 1 times [2019-10-22 09:03:13,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:13,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383945881] [2019-10-22 09:03:13,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:13,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383945881] [2019-10-22 09:03:13,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:13,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:13,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019552797] [2019-10-22 09:03:13,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:13,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:13,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:13,791 INFO L87 Difference]: Start difference. First operand 17682 states and 52846 transitions. Second operand 5 states. [2019-10-22 09:03:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:14,015 INFO L93 Difference]: Finished difference Result 22456 states and 66794 transitions. [2019-10-22 09:03:14,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:14,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:03:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:14,040 INFO L225 Difference]: With dead ends: 22456 [2019-10-22 09:03:14,040 INFO L226 Difference]: Without dead ends: 22456 [2019-10-22 09:03:14,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22456 states. [2019-10-22 09:03:14,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22456 to 18976. [2019-10-22 09:03:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18976 states. [2019-10-22 09:03:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18976 states to 18976 states and 56242 transitions. [2019-10-22 09:03:14,246 INFO L78 Accepts]: Start accepts. Automaton has 18976 states and 56242 transitions. Word has length 65 [2019-10-22 09:03:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,246 INFO L462 AbstractCegarLoop]: Abstraction has 18976 states and 56242 transitions. [2019-10-22 09:03:14,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 18976 states and 56242 transitions. [2019-10-22 09:03:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:14,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,255 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,255 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1532158898, now seen corresponding path program 1 times [2019-10-22 09:03:14,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917276231] [2019-10-22 09:03:14,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:14,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917276231] [2019-10-22 09:03:14,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:14,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:14,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686920589] [2019-10-22 09:03:14,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:14,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:14,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:14,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:14,340 INFO L87 Difference]: Start difference. First operand 18976 states and 56242 transitions. Second operand 5 states. [2019-10-22 09:03:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:14,641 INFO L93 Difference]: Finished difference Result 25570 states and 75562 transitions. [2019-10-22 09:03:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:14,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:03:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:14,670 INFO L225 Difference]: With dead ends: 25570 [2019-10-22 09:03:14,670 INFO L226 Difference]: Without dead ends: 25570 [2019-10-22 09:03:14,670 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25570 states. [2019-10-22 09:03:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25570 to 20142. [2019-10-22 09:03:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20142 states. [2019-10-22 09:03:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20142 states to 20142 states and 59686 transitions. [2019-10-22 09:03:14,909 INFO L78 Accepts]: Start accepts. Automaton has 20142 states and 59686 transitions. Word has length 65 [2019-10-22 09:03:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,910 INFO L462 AbstractCegarLoop]: Abstraction has 20142 states and 59686 transitions. [2019-10-22 09:03:14,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20142 states and 59686 transitions. [2019-10-22 09:03:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:14,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,919 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 955353935, now seen corresponding path program 1 times [2019-10-22 09:03:14,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185477328] [2019-10-22 09:03:14,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:14,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185477328] [2019-10-22 09:03:14,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:14,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:14,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053271135] [2019-10-22 09:03:14,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:14,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:14,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:14,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:14,963 INFO L87 Difference]: Start difference. First operand 20142 states and 59686 transitions. Second operand 4 states. [2019-10-22 09:03:15,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:15,291 INFO L93 Difference]: Finished difference Result 26770 states and 79457 transitions. [2019-10-22 09:03:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:15,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 09:03:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:15,322 INFO L225 Difference]: With dead ends: 26770 [2019-10-22 09:03:15,322 INFO L226 Difference]: Without dead ends: 26390 [2019-10-22 09:03:15,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26390 states. [2019-10-22 09:03:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26390 to 24446. [2019-10-22 09:03:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24446 states. [2019-10-22 09:03:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24446 states to 24446 states and 72598 transitions. [2019-10-22 09:03:15,598 INFO L78 Accepts]: Start accepts. Automaton has 24446 states and 72598 transitions. Word has length 65 [2019-10-22 09:03:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:15,598 INFO L462 AbstractCegarLoop]: Abstraction has 24446 states and 72598 transitions. [2019-10-22 09:03:15,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 24446 states and 72598 transitions. [2019-10-22 09:03:15,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:15,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:15,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:15,612 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:15,612 INFO L82 PathProgramCache]: Analyzing trace with hash -841597424, now seen corresponding path program 1 times [2019-10-22 09:03:15,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:15,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347899349] [2019-10-22 09:03:15,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:15,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:15,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:15,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347899349] [2019-10-22 09:03:15,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:15,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:15,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517841457] [2019-10-22 09:03:15,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:15,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:15,709 INFO L87 Difference]: Start difference. First operand 24446 states and 72598 transitions. Second operand 5 states. [2019-10-22 09:03:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:15,779 INFO L93 Difference]: Finished difference Result 21062 states and 59208 transitions. [2019-10-22 09:03:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:15,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:03:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:15,799 INFO L225 Difference]: With dead ends: 21062 [2019-10-22 09:03:15,799 INFO L226 Difference]: Without dead ends: 21062 [2019-10-22 09:03:15,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2019-10-22 09:03:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 14080. [2019-10-22 09:03:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14080 states. [2019-10-22 09:03:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14080 states to 14080 states and 39782 transitions. [2019-10-22 09:03:15,966 INFO L78 Accepts]: Start accepts. Automaton has 14080 states and 39782 transitions. Word has length 65 [2019-10-22 09:03:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:15,966 INFO L462 AbstractCegarLoop]: Abstraction has 14080 states and 39782 transitions. [2019-10-22 09:03:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 14080 states and 39782 transitions. [2019-10-22 09:03:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:15,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:15,972 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:15,973 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash 45906257, now seen corresponding path program 1 times [2019-10-22 09:03:15,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:15,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713578684] [2019-10-22 09:03:15,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:15,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:15,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:16,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713578684] [2019-10-22 09:03:16,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:16,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:16,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359791448] [2019-10-22 09:03:16,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:16,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:16,042 INFO L87 Difference]: Start difference. First operand 14080 states and 39782 transitions. Second operand 5 states. [2019-10-22 09:03:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:16,072 INFO L93 Difference]: Finished difference Result 4132 states and 9829 transitions. [2019-10-22 09:03:16,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:16,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:03:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:16,074 INFO L225 Difference]: With dead ends: 4132 [2019-10-22 09:03:16,074 INFO L226 Difference]: Without dead ends: 3390 [2019-10-22 09:03:16,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2019-10-22 09:03:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3045. [2019-10-22 09:03:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3045 states. [2019-10-22 09:03:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3045 states to 3045 states and 7039 transitions. [2019-10-22 09:03:16,098 INFO L78 Accepts]: Start accepts. Automaton has 3045 states and 7039 transitions. Word has length 65 [2019-10-22 09:03:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:16,098 INFO L462 AbstractCegarLoop]: Abstraction has 3045 states and 7039 transitions. [2019-10-22 09:03:16,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3045 states and 7039 transitions. [2019-10-22 09:03:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:16,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:16,100 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:16,101 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 529305649, now seen corresponding path program 1 times [2019-10-22 09:03:16,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:16,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875809284] [2019-10-22 09:03:16,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:16,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875809284] [2019-10-22 09:03:16,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:16,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:16,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598492483] [2019-10-22 09:03:16,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:16,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:16,205 INFO L87 Difference]: Start difference. First operand 3045 states and 7039 transitions. Second operand 7 states. [2019-10-22 09:03:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:16,587 INFO L93 Difference]: Finished difference Result 3785 states and 8647 transitions. [2019-10-22 09:03:16,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:03:16,587 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 09:03:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:16,589 INFO L225 Difference]: With dead ends: 3785 [2019-10-22 09:03:16,590 INFO L226 Difference]: Without dead ends: 3751 [2019-10-22 09:03:16,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:03:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2019-10-22 09:03:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3217. [2019-10-22 09:03:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-10-22 09:03:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 7400 transitions. [2019-10-22 09:03:16,614 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 7400 transitions. Word has length 82 [2019-10-22 09:03:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:16,615 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 7400 transitions. [2019-10-22 09:03:16,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 7400 transitions. [2019-10-22 09:03:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:16,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:16,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:16,618 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1547903694, now seen corresponding path program 1 times [2019-10-22 09:03:16,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:16,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999613280] [2019-10-22 09:03:16,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:16,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999613280] [2019-10-22 09:03:16,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:16,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:16,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30162686] [2019-10-22 09:03:16,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:16,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:16,708 INFO L87 Difference]: Start difference. First operand 3217 states and 7400 transitions. Second operand 6 states. [2019-10-22 09:03:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:16,779 INFO L93 Difference]: Finished difference Result 5475 states and 12698 transitions. [2019-10-22 09:03:16,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:16,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:16,784 INFO L225 Difference]: With dead ends: 5475 [2019-10-22 09:03:16,784 INFO L226 Difference]: Without dead ends: 4879 [2019-10-22 09:03:16,785 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:03:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-10-22 09:03:16,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 3121. [2019-10-22 09:03:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2019-10-22 09:03:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 7192 transitions. [2019-10-22 09:03:16,828 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 7192 transitions. Word has length 82 [2019-10-22 09:03:16,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:16,829 INFO L462 AbstractCegarLoop]: Abstraction has 3121 states and 7192 transitions. [2019-10-22 09:03:16,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 7192 transitions. [2019-10-22 09:03:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:16,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:16,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:16,833 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash -469329194, now seen corresponding path program 2 times [2019-10-22 09:03:16,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:16,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537934932] [2019-10-22 09:03:16,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:16,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:16,919 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537934932] [2019-10-22 09:03:16,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:16,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:16,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247478005] [2019-10-22 09:03:16,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:16,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:16,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:16,920 INFO L87 Difference]: Start difference. First operand 3121 states and 7192 transitions. Second operand 6 states. [2019-10-22 09:03:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:16,981 INFO L93 Difference]: Finished difference Result 5355 states and 12436 transitions. [2019-10-22 09:03:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:16,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:16,984 INFO L225 Difference]: With dead ends: 5355 [2019-10-22 09:03:16,984 INFO L226 Difference]: Without dead ends: 2338 [2019-10-22 09:03:16,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:03:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-10-22 09:03:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2338. [2019-10-22 09:03:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2019-10-22 09:03:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 5433 transitions. [2019-10-22 09:03:17,008 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 5433 transitions. Word has length 82 [2019-10-22 09:03:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:17,008 INFO L462 AbstractCegarLoop]: Abstraction has 2338 states and 5433 transitions. [2019-10-22 09:03:17,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 5433 transitions. [2019-10-22 09:03:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:17,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:17,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:17,011 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 282050159, now seen corresponding path program 2 times [2019-10-22 09:03:17,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:17,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079520579] [2019-10-22 09:03:17,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:17,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079520579] [2019-10-22 09:03:17,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:17,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:17,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155068052] [2019-10-22 09:03:17,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:17,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:17,127 INFO L87 Difference]: Start difference. First operand 2338 states and 5433 transitions. Second operand 6 states. [2019-10-22 09:03:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:17,336 INFO L93 Difference]: Finished difference Result 2617 states and 6024 transitions. [2019-10-22 09:03:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:17,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:17,339 INFO L225 Difference]: With dead ends: 2617 [2019-10-22 09:03:17,339 INFO L226 Difference]: Without dead ends: 2575 [2019-10-22 09:03:17,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-10-22 09:03:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2289. [2019-10-22 09:03:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2289 states. [2019-10-22 09:03:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 5285 transitions. [2019-10-22 09:03:17,366 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 5285 transitions. Word has length 82 [2019-10-22 09:03:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:17,366 INFO L462 AbstractCegarLoop]: Abstraction has 2289 states and 5285 transitions. [2019-10-22 09:03:17,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 5285 transitions. [2019-10-22 09:03:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:17,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:17,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:17,369 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:17,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1795159184, now seen corresponding path program 3 times [2019-10-22 09:03:17,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:17,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879947825] [2019-10-22 09:03:17,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:17,445 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:17,445 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:03:17,540 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:03:17,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:17 BasicIcfg [2019-10-22 09:03:17,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:17,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:17,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:17,549 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:17,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:51" (3/4) ... [2019-10-22 09:03:17,552 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:03:17,659 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a95537cb-82d9-469e-aa6e-22332e358108/bin/uautomizer/witness.graphml [2019-10-22 09:03:17,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:17,660 INFO L168 Benchmark]: Toolchain (without parser) took 27568.49 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 939.1 MB in the beginning and 1.5 GB in the end (delta: -555.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,661 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:17,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:17,661 INFO L168 Benchmark]: Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,661 INFO L168 Benchmark]: RCFGBuilder took 619.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,662 INFO L168 Benchmark]: TraceAbstraction took 26172.26 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -519.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,662 INFO L168 Benchmark]: Witness Printer took 109.96 ms. Allocated memory is still 3.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:17,663 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 568.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26172.26 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -519.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 109.96 ms. Allocated memory is still 3.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2565; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2566; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 197 locations, 3 error locations. Result: UNSAFE, OverallTime: 26.0s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6056 SDtfs, 6919 SDslu, 11870 SDs, 0 SdLazy, 4662 SolverSat, 370 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61470occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 71739 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 233551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 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...