./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.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/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/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 ff5c85ebee88b83fb277698b63b87ea24f313b6a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-15 23:59:20,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:59:20,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:59:20,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:59:20,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:59:20,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:59:20,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:59:20,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:59:20,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:59:20,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:59:20,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:59:20,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:59:20,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:59:20,933 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:59:20,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:59:20,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:59:20,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:59:20,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:59:20,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:59:20,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:59:20,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:59:20,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:59:20,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:59:20,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:59:20,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:59:20,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:59:20,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:59:20,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:59:20,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:59:20,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:59:20,948 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:59:20,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:59:20,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:59:20,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:59:20,951 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:59:20,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:59:20,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:59:20,952 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:59:20,952 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:59:20,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:59:20,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:59:20,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:59:20,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:59:20,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:59:20,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:59:20,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:59:20,968 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:59:20,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:59:20,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:59:20,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:59:20,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:59:20,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:59:20,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:59:20,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:59:20,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:59:20,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:59:20,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:59:20,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:59:20,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:59:20,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:59:20,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:59:20,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:59:20,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:59:20,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:59:20,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:59:20,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:59:20,972 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:59:20,972 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:59:20,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:59:20,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:59:20,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/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 -> ff5c85ebee88b83fb277698b63b87ea24f313b6a [2019-11-15 23:59:20,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:59:21,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:59:21,012 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:59:21,013 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:59:21,014 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:59:21,015 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-15 23:59:21,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/data/f6d740b00/d6f2b66bd25143fd8ac8c82a41e9e4f7/FLAG9f82f3f87 [2019-11-15 23:59:21,538 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:59:21,539 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-15 23:59:21,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/data/f6d740b00/d6f2b66bd25143fd8ac8c82a41e9e4f7/FLAG9f82f3f87 [2019-11-15 23:59:21,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/data/f6d740b00/d6f2b66bd25143fd8ac8c82a41e9e4f7 [2019-11-15 23:59:21,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:59:21,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:59:21,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:59:21,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:59:21,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:59:21,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:59:21" (1/1) ... [2019-11-15 23:59:21,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2adc5693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:21, skipping insertion in model container [2019-11-15 23:59:21,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:59:21" (1/1) ... [2019-11-15 23:59:21,828 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:59:21,873 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:59:22,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:59:22,299 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:59:22,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:59:22,460 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:59:22,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22 WrapperNode [2019-11-15 23:59:22,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:59:22,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:59:22,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:59:22,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:59:22,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:59:22,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:59:22,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:59:22,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:59:22,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... [2019-11-15 23:59:22,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:59:22,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:59:22,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:59:22,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:59:22,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:59:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:59:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:59:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:59:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:59:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:59:22,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:59:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:59:22,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:59:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:59:22,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:59:22,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:59:22,721 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:59:23,429 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:59:23,430 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:59:23,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:23 BoogieIcfgContainer [2019-11-15 23:59:23,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:59:23,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:59:23,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:59:23,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:59:23,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:59:21" (1/3) ... [2019-11-15 23:59:23,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d634fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:59:23, skipping insertion in model container [2019-11-15 23:59:23,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:59:22" (2/3) ... [2019-11-15 23:59:23,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d634fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:59:23, skipping insertion in model container [2019-11-15 23:59:23,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:23" (3/3) ... [2019-11-15 23:59:23,444 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-11-15 23:59:23,503 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,503 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,503 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,503 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,504 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,504 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,504 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,504 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,505 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,506 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,507 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,508 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,509 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,510 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,511 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,512 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,513 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,513 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,513 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,514 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,515 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,517 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,517 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,517 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,517 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,518 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,518 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,518 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,518 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,518 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,519 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,520 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,520 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,520 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,520 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,521 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,521 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,521 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,521 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,522 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,522 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,522 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,522 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,523 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,524 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,524 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,524 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,524 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,525 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,526 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,527 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,528 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,529 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,530 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,531 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,532 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,532 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,532 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,533 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,533 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,537 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,541 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,542 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,550 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,551 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,552 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,553 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:59:23,562 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:59:23,563 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:59:23,573 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:59:23,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:59:23,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:59:23,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:59:23,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:59:23,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:59:23,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:59:23,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:59:23,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:59:23,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:59:23,627 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 130 places, 162 transitions [2019-11-15 23:59:25,498 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25976 states. [2019-11-15 23:59:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 25976 states. [2019-11-15 23:59:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:59:25,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:25,512 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] [2019-11-15 23:59:25,514 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:25,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:25,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1781979466, now seen corresponding path program 1 times [2019-11-15 23:59:25,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:25,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755312355] [2019-11-15 23:59:25,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:25,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:25,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:25,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755312355] [2019-11-15 23:59:25,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:25,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:25,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425926518] [2019-11-15 23:59:25,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:25,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:25,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:25,821 INFO L87 Difference]: Start difference. First operand 25976 states. Second operand 4 states. [2019-11-15 23:59:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:26,392 INFO L93 Difference]: Finished difference Result 26616 states and 102121 transitions. [2019-11-15 23:59:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:26,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-15 23:59:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:26,611 INFO L225 Difference]: With dead ends: 26616 [2019-11-15 23:59:26,611 INFO L226 Difference]: Without dead ends: 20360 [2019-11-15 23:59:26,613 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-11-15 23:59:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20360 states. [2019-11-15 23:59:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20360 to 20360. [2019-11-15 23:59:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-11-15 23:59:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 78425 transitions. [2019-11-15 23:59:27,949 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 78425 transitions. Word has length 39 [2019-11-15 23:59:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 78425 transitions. [2019-11-15 23:59:27,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 78425 transitions. [2019-11-15 23:59:27,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 23:59:27,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:27,964 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-11-15 23:59:27,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -641861907, now seen corresponding path program 1 times [2019-11-15 23:59:27,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:27,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124094831] [2019-11-15 23:59:27,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:27,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:27,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:28,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124094831] [2019-11-15 23:59:28,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:28,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:28,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172256505] [2019-11-15 23:59:28,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:28,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:28,162 INFO L87 Difference]: Start difference. First operand 20360 states and 78425 transitions. Second operand 5 states. [2019-11-15 23:59:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:29,405 INFO L93 Difference]: Finished difference Result 31838 states and 116042 transitions. [2019-11-15 23:59:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:29,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-15 23:59:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:29,562 INFO L225 Difference]: With dead ends: 31838 [2019-11-15 23:59:29,562 INFO L226 Difference]: Without dead ends: 31286 [2019-11-15 23:59:29,564 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-11-15 23:59:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31286 states. [2019-11-15 23:59:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31286 to 29705. [2019-11-15 23:59:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29705 states. [2019-11-15 23:59:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 109519 transitions. [2019-11-15 23:59:30,875 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 109519 transitions. Word has length 47 [2019-11-15 23:59:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:30,877 INFO L462 AbstractCegarLoop]: Abstraction has 29705 states and 109519 transitions. [2019-11-15 23:59:30,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 109519 transitions. [2019-11-15 23:59:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:59:30,883 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:30,883 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] [2019-11-15 23:59:30,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash -544418433, now seen corresponding path program 1 times [2019-11-15 23:59:30,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:30,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575355693] [2019-11-15 23:59:30,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:30,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:30,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:30,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575355693] [2019-11-15 23:59:30,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:30,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:30,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944973571] [2019-11-15 23:59:30,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:30,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:30,961 INFO L87 Difference]: Start difference. First operand 29705 states and 109519 transitions. Second operand 5 states. [2019-11-15 23:59:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:31,907 INFO L93 Difference]: Finished difference Result 38696 states and 139691 transitions. [2019-11-15 23:59:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:31,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-15 23:59:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:32,068 INFO L225 Difference]: With dead ends: 38696 [2019-11-15 23:59:32,068 INFO L226 Difference]: Without dead ends: 38248 [2019-11-15 23:59:32,069 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-11-15 23:59:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38248 states. [2019-11-15 23:59:32,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38248 to 32951. [2019-11-15 23:59:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32951 states. [2019-11-15 23:59:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32951 states to 32951 states and 120528 transitions. [2019-11-15 23:59:33,037 INFO L78 Accepts]: Start accepts. Automaton has 32951 states and 120528 transitions. Word has length 48 [2019-11-15 23:59:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:33,039 INFO L462 AbstractCegarLoop]: Abstraction has 32951 states and 120528 transitions. [2019-11-15 23:59:33,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 32951 states and 120528 transitions. [2019-11-15 23:59:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:59:33,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:33,051 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] [2019-11-15 23:59:33,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:33,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1683421989, now seen corresponding path program 1 times [2019-11-15 23:59:33,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:33,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856788851] [2019-11-15 23:59:33,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:33,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:33,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:33,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856788851] [2019-11-15 23:59:33,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:33,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:33,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143345123] [2019-11-15 23:59:33,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:59:33,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:33,109 INFO L87 Difference]: Start difference. First operand 32951 states and 120528 transitions. Second operand 3 states. [2019-11-15 23:59:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:33,395 INFO L93 Difference]: Finished difference Result 42412 states and 152019 transitions. [2019-11-15 23:59:33,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:33,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 23:59:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:33,679 INFO L225 Difference]: With dead ends: 42412 [2019-11-15 23:59:33,679 INFO L226 Difference]: Without dead ends: 42412 [2019-11-15 23:59:33,680 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-11-15 23:59:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42412 states. [2019-11-15 23:59:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42412 to 37665. [2019-11-15 23:59:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37665 states. [2019-11-15 23:59:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37665 states to 37665 states and 136332 transitions. [2019-11-15 23:59:35,016 INFO L78 Accepts]: Start accepts. Automaton has 37665 states and 136332 transitions. Word has length 50 [2019-11-15 23:59:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:35,016 INFO L462 AbstractCegarLoop]: Abstraction has 37665 states and 136332 transitions. [2019-11-15 23:59:35,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:59:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 37665 states and 136332 transitions. [2019-11-15 23:59:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:59:35,037 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:35,037 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] [2019-11-15 23:59:35,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash 414760560, now seen corresponding path program 1 times [2019-11-15 23:59:35,043 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:35,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985623123] [2019-11-15 23:59:35,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:35,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:35,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:35,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985623123] [2019-11-15 23:59:35,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:35,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:35,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169424731] [2019-11-15 23:59:35,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:35,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:35,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:35,149 INFO L87 Difference]: Start difference. First operand 37665 states and 136332 transitions. Second operand 6 states. [2019-11-15 23:59:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:35,928 INFO L93 Difference]: Finished difference Result 48756 states and 172981 transitions. [2019-11-15 23:59:35,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:59:35,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:59:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:36,186 INFO L225 Difference]: With dead ends: 48756 [2019-11-15 23:59:36,187 INFO L226 Difference]: Without dead ends: 48236 [2019-11-15 23:59:36,188 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:59:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48236 states. [2019-11-15 23:59:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48236 to 38229. [2019-11-15 23:59:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38229 states. [2019-11-15 23:59:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38229 states to 38229 states and 138495 transitions. [2019-11-15 23:59:37,648 INFO L78 Accepts]: Start accepts. Automaton has 38229 states and 138495 transitions. Word has length 54 [2019-11-15 23:59:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:37,649 INFO L462 AbstractCegarLoop]: Abstraction has 38229 states and 138495 transitions. [2019-11-15 23:59:37,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38229 states and 138495 transitions. [2019-11-15 23:59:37,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:59:37,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:37,664 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] [2019-11-15 23:59:37,664 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:37,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -17470822, now seen corresponding path program 1 times [2019-11-15 23:59:37,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:37,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883107685] [2019-11-15 23:59:37,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:37,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:37,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:37,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:37,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883107685] [2019-11-15 23:59:37,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:37,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:37,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467687971] [2019-11-15 23:59:37,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:37,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:37,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:37,779 INFO L87 Difference]: Start difference. First operand 38229 states and 138495 transitions. Second operand 6 states. [2019-11-15 23:59:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:38,620 INFO L93 Difference]: Finished difference Result 53005 states and 189571 transitions. [2019-11-15 23:59:38,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:38,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-15 23:59:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:38,743 INFO L225 Difference]: With dead ends: 53005 [2019-11-15 23:59:38,743 INFO L226 Difference]: Without dead ends: 52029 [2019-11-15 23:59:38,744 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-11-15 23:59:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52029 states. [2019-11-15 23:59:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52029 to 48782. [2019-11-15 23:59:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48782 states. [2019-11-15 23:59:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48782 states to 48782 states and 175226 transitions. [2019-11-15 23:59:39,741 INFO L78 Accepts]: Start accepts. Automaton has 48782 states and 175226 transitions. Word has length 54 [2019-11-15 23:59:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:39,741 INFO L462 AbstractCegarLoop]: Abstraction has 48782 states and 175226 transitions. [2019-11-15 23:59:39,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:39,741 INFO L276 IsEmpty]: Start isEmpty. Operand 48782 states and 175226 transitions. [2019-11-15 23:59:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:59:40,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:40,313 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] [2019-11-15 23:59:40,313 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:40,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1814422181, now seen corresponding path program 1 times [2019-11-15 23:59:40,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:40,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038544799] [2019-11-15 23:59:40,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:40,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:40,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:40,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038544799] [2019-11-15 23:59:40,458 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:40,458 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:59:40,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474472080] [2019-11-15 23:59:40,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:59:40,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:59:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:59:40,460 INFO L87 Difference]: Start difference. First operand 48782 states and 175226 transitions. Second operand 7 states. [2019-11-15 23:59:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:41,759 INFO L93 Difference]: Finished difference Result 70897 states and 244523 transitions. [2019-11-15 23:59:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:59:41,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-15 23:59:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:41,907 INFO L225 Difference]: With dead ends: 70897 [2019-11-15 23:59:41,907 INFO L226 Difference]: Without dead ends: 70897 [2019-11-15 23:59:41,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:59:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70897 states. [2019-11-15 23:59:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70897 to 57890. [2019-11-15 23:59:42,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57890 states. [2019-11-15 23:59:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57890 states to 57890 states and 203150 transitions. [2019-11-15 23:59:43,064 INFO L78 Accepts]: Start accepts. Automaton has 57890 states and 203150 transitions. Word has length 54 [2019-11-15 23:59:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:43,064 INFO L462 AbstractCegarLoop]: Abstraction has 57890 states and 203150 transitions. [2019-11-15 23:59:43,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:59:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57890 states and 203150 transitions. [2019-11-15 23:59:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:59:43,079 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:43,079 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] [2019-11-15 23:59:43,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash -926918500, now seen corresponding path program 1 times [2019-11-15 23:59:43,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:43,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275188153] [2019-11-15 23:59:43,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:43,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:43,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:43,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275188153] [2019-11-15 23:59:43,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:43,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:59:43,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137957823] [2019-11-15 23:59:43,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:59:43,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:59:43,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:43,140 INFO L87 Difference]: Start difference. First operand 57890 states and 203150 transitions. Second operand 3 states. [2019-11-15 23:59:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:43,318 INFO L93 Difference]: Finished difference Result 43856 states and 152833 transitions. [2019-11-15 23:59:43,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:59:43,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:59:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:43,403 INFO L225 Difference]: With dead ends: 43856 [2019-11-15 23:59:43,403 INFO L226 Difference]: Without dead ends: 43352 [2019-11-15 23:59:43,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:59:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43352 states. [2019-11-15 23:59:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43352 to 41886. [2019-11-15 23:59:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41886 states. [2019-11-15 23:59:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41886 states to 41886 states and 146704 transitions. [2019-11-15 23:59:44,546 INFO L78 Accepts]: Start accepts. Automaton has 41886 states and 146704 transitions. Word has length 54 [2019-11-15 23:59:44,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:44,546 INFO L462 AbstractCegarLoop]: Abstraction has 41886 states and 146704 transitions. [2019-11-15 23:59:44,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:59:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 41886 states and 146704 transitions. [2019-11-15 23:59:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:59:44,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:44,558 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] [2019-11-15 23:59:44,558 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1199902892, now seen corresponding path program 1 times [2019-11-15 23:59:44,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:44,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223761656] [2019-11-15 23:59:44,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:44,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:44,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:44,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223761656] [2019-11-15 23:59:44,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:44,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:44,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404966777] [2019-11-15 23:59:44,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:44,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:44,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:44,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:44,648 INFO L87 Difference]: Start difference. First operand 41886 states and 146704 transitions. Second operand 6 states. [2019-11-15 23:59:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:45,483 INFO L93 Difference]: Finished difference Result 54549 states and 184834 transitions. [2019-11-15 23:59:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:45,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-15 23:59:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:45,593 INFO L225 Difference]: With dead ends: 54549 [2019-11-15 23:59:45,593 INFO L226 Difference]: Without dead ends: 54549 [2019-11-15 23:59:45,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:59:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54549 states. [2019-11-15 23:59:46,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54549 to 45861. [2019-11-15 23:59:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45861 states. [2019-11-15 23:59:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45861 states to 45861 states and 158167 transitions. [2019-11-15 23:59:46,446 INFO L78 Accepts]: Start accepts. Automaton has 45861 states and 158167 transitions. Word has length 55 [2019-11-15 23:59:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:46,447 INFO L462 AbstractCegarLoop]: Abstraction has 45861 states and 158167 transitions. [2019-11-15 23:59:46,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:46,447 INFO L276 IsEmpty]: Start isEmpty. Operand 45861 states and 158167 transitions. [2019-11-15 23:59:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 23:59:46,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:46,458 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] [2019-11-15 23:59:46,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash -312399211, now seen corresponding path program 1 times [2019-11-15 23:59:46,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:46,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615312735] [2019-11-15 23:59:46,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:46,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:46,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:46,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615312735] [2019-11-15 23:59:46,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:46,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:46,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537833778] [2019-11-15 23:59:46,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:46,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:46,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:46,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:46,529 INFO L87 Difference]: Start difference. First operand 45861 states and 158167 transitions. Second operand 4 states. [2019-11-15 23:59:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:46,576 INFO L93 Difference]: Finished difference Result 8163 states and 24871 transitions. [2019-11-15 23:59:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:59:46,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-15 23:59:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:46,586 INFO L225 Difference]: With dead ends: 8163 [2019-11-15 23:59:46,586 INFO L226 Difference]: Without dead ends: 6754 [2019-11-15 23:59:46,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-15 23:59:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6754 states. [2019-11-15 23:59:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6754 to 6706. [2019-11-15 23:59:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6706 states. [2019-11-15 23:59:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6706 states to 6706 states and 20040 transitions. [2019-11-15 23:59:46,670 INFO L78 Accepts]: Start accepts. Automaton has 6706 states and 20040 transitions. Word has length 55 [2019-11-15 23:59:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:46,670 INFO L462 AbstractCegarLoop]: Abstraction has 6706 states and 20040 transitions. [2019-11-15 23:59:46,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 6706 states and 20040 transitions. [2019-11-15 23:59:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:59:46,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:46,674 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] [2019-11-15 23:59:46,674 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1147974095, now seen corresponding path program 1 times [2019-11-15 23:59:46,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:46,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844625699] [2019-11-15 23:59:46,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:46,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:46,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:46,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844625699] [2019-11-15 23:59:46,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:46,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:46,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496886196] [2019-11-15 23:59:46,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:46,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:46,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:46,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:46,736 INFO L87 Difference]: Start difference. First operand 6706 states and 20040 transitions. Second operand 4 states. [2019-11-15 23:59:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:46,895 INFO L93 Difference]: Finished difference Result 7891 states and 23389 transitions. [2019-11-15 23:59:46,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:59:46,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 23:59:46,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:46,906 INFO L225 Difference]: With dead ends: 7891 [2019-11-15 23:59:46,906 INFO L226 Difference]: Without dead ends: 7891 [2019-11-15 23:59:46,906 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-11-15 23:59:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-11-15 23:59:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7213. [2019-11-15 23:59:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-11-15 23:59:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 21446 transitions. [2019-11-15 23:59:47,024 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 21446 transitions. Word has length 64 [2019-11-15 23:59:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:47,024 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 21446 transitions. [2019-11-15 23:59:47,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 21446 transitions. [2019-11-15 23:59:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:59:47,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:47,029 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] [2019-11-15 23:59:47,029 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:47,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1404182866, now seen corresponding path program 1 times [2019-11-15 23:59:47,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:47,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608627887] [2019-11-15 23:59:47,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:47,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608627887] [2019-11-15 23:59:47,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:47,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:47,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487573554] [2019-11-15 23:59:47,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:47,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:47,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:47,105 INFO L87 Difference]: Start difference. First operand 7213 states and 21446 transitions. Second operand 6 states. [2019-11-15 23:59:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:47,488 INFO L93 Difference]: Finished difference Result 9268 states and 27195 transitions. [2019-11-15 23:59:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:59:47,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-11-15 23:59:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:47,500 INFO L225 Difference]: With dead ends: 9268 [2019-11-15 23:59:47,501 INFO L226 Difference]: Without dead ends: 9220 [2019-11-15 23:59:47,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:59:47,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9220 states. [2019-11-15 23:59:47,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9220 to 8052. [2019-11-15 23:59:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8052 states. [2019-11-15 23:59:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8052 states to 8052 states and 23826 transitions. [2019-11-15 23:59:47,634 INFO L78 Accepts]: Start accepts. Automaton has 8052 states and 23826 transitions. Word has length 64 [2019-11-15 23:59:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:47,634 INFO L462 AbstractCegarLoop]: Abstraction has 8052 states and 23826 transitions. [2019-11-15 23:59:47,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8052 states and 23826 transitions. [2019-11-15 23:59:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:47,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:47,644 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] [2019-11-15 23:59:47,645 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1579437298, now seen corresponding path program 1 times [2019-11-15 23:59:47,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:47,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274492893] [2019-11-15 23:59:47,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:47,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274492893] [2019-11-15 23:59:47,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:47,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:47,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099624613] [2019-11-15 23:59:47,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:47,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:47,743 INFO L87 Difference]: Start difference. First operand 8052 states and 23826 transitions. Second operand 4 states. [2019-11-15 23:59:48,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:48,018 INFO L93 Difference]: Finished difference Result 10665 states and 31175 transitions. [2019-11-15 23:59:48,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:48,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:59:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:48,037 INFO L225 Difference]: With dead ends: 10665 [2019-11-15 23:59:48,037 INFO L226 Difference]: Without dead ends: 10665 [2019-11-15 23:59:48,038 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-11-15 23:59:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10665 states. [2019-11-15 23:59:48,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10665 to 9075. [2019-11-15 23:59:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-11-15 23:59:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26645 transitions. [2019-11-15 23:59:48,183 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26645 transitions. Word has length 68 [2019-11-15 23:59:48,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:48,183 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26645 transitions. [2019-11-15 23:59:48,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26645 transitions. [2019-11-15 23:59:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:48,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:48,191 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] [2019-11-15 23:59:48,192 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash -334672817, now seen corresponding path program 1 times [2019-11-15 23:59:48,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:48,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061065496] [2019-11-15 23:59:48,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:48,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:48,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:48,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:48,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061065496] [2019-11-15 23:59:48,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:48,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:48,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932000164] [2019-11-15 23:59:48,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:48,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:48,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:48,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:48,316 INFO L87 Difference]: Start difference. First operand 9075 states and 26645 transitions. Second operand 6 states. [2019-11-15 23:59:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:48,912 INFO L93 Difference]: Finished difference Result 10385 states and 29896 transitions. [2019-11-15 23:59:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:48,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:59:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:48,926 INFO L225 Difference]: With dead ends: 10385 [2019-11-15 23:59:48,926 INFO L226 Difference]: Without dead ends: 10385 [2019-11-15 23:59:48,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:59:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2019-11-15 23:59:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 10082. [2019-11-15 23:59:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10082 states. [2019-11-15 23:59:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10082 states to 10082 states and 29119 transitions. [2019-11-15 23:59:49,058 INFO L78 Accepts]: Start accepts. Automaton has 10082 states and 29119 transitions. Word has length 68 [2019-11-15 23:59:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:49,058 INFO L462 AbstractCegarLoop]: Abstraction has 10082 states and 29119 transitions. [2019-11-15 23:59:49,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 10082 states and 29119 transitions. [2019-11-15 23:59:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:49,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:49,068 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] [2019-11-15 23:59:49,068 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1883085136, now seen corresponding path program 1 times [2019-11-15 23:59:49,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:49,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24444220] [2019-11-15 23:59:49,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:49,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:49,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:49,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24444220] [2019-11-15 23:59:49,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:49,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:49,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291251615] [2019-11-15 23:59:49,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:49,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:49,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:49,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:49,212 INFO L87 Difference]: Start difference. First operand 10082 states and 29119 transitions. Second operand 6 states. [2019-11-15 23:59:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:49,576 INFO L93 Difference]: Finished difference Result 11999 states and 33626 transitions. [2019-11-15 23:59:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:59:49,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:59:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:49,589 INFO L225 Difference]: With dead ends: 11999 [2019-11-15 23:59:49,589 INFO L226 Difference]: Without dead ends: 11999 [2019-11-15 23:59:49,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:59:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11999 states. [2019-11-15 23:59:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11999 to 10301. [2019-11-15 23:59:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10301 states. [2019-11-15 23:59:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10301 states to 10301 states and 29171 transitions. [2019-11-15 23:59:49,722 INFO L78 Accepts]: Start accepts. Automaton has 10301 states and 29171 transitions. Word has length 68 [2019-11-15 23:59:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:49,722 INFO L462 AbstractCegarLoop]: Abstraction has 10301 states and 29171 transitions. [2019-11-15 23:59:49,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 10301 states and 29171 transitions. [2019-11-15 23:59:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:49,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:49,731 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] [2019-11-15 23:59:49,732 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2094436049, now seen corresponding path program 1 times [2019-11-15 23:59:49,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:49,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50256696] [2019-11-15 23:59:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:49,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:49,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:49,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50256696] [2019-11-15 23:59:49,841 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:49,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:49,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363694819] [2019-11-15 23:59:49,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:49,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:49,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:49,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:49,842 INFO L87 Difference]: Start difference. First operand 10301 states and 29171 transitions. Second operand 5 states. [2019-11-15 23:59:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:50,075 INFO L93 Difference]: Finished difference Result 12576 states and 35464 transitions. [2019-11-15 23:59:50,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:59:50,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:59:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:50,091 INFO L225 Difference]: With dead ends: 12576 [2019-11-15 23:59:50,091 INFO L226 Difference]: Without dead ends: 12576 [2019-11-15 23:59:50,091 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-11-15 23:59:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2019-11-15 23:59:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 11076. [2019-11-15 23:59:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11076 states. [2019-11-15 23:59:50,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11076 states to 11076 states and 31105 transitions. [2019-11-15 23:59:50,233 INFO L78 Accepts]: Start accepts. Automaton has 11076 states and 31105 transitions. Word has length 68 [2019-11-15 23:59:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:50,233 INFO L462 AbstractCegarLoop]: Abstraction has 11076 states and 31105 transitions. [2019-11-15 23:59:50,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 11076 states and 31105 transitions. [2019-11-15 23:59:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:50,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:50,240 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] [2019-11-15 23:59:50,240 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:50,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1583901872, now seen corresponding path program 1 times [2019-11-15 23:59:50,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:50,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467025748] [2019-11-15 23:59:50,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:50,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:50,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:50,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467025748] [2019-11-15 23:59:50,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:50,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:50,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297918019] [2019-11-15 23:59:50,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:50,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:50,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:50,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:50,338 INFO L87 Difference]: Start difference. First operand 11076 states and 31105 transitions. Second operand 6 states. [2019-11-15 23:59:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:50,895 INFO L93 Difference]: Finished difference Result 17070 states and 47866 transitions. [2019-11-15 23:59:50,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:50,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-15 23:59:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:50,917 INFO L225 Difference]: With dead ends: 17070 [2019-11-15 23:59:50,917 INFO L226 Difference]: Without dead ends: 17070 [2019-11-15 23:59:50,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:59:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17070 states. [2019-11-15 23:59:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17070 to 14148. [2019-11-15 23:59:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-11-15 23:59:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 39930 transitions. [2019-11-15 23:59:51,122 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 39930 transitions. Word has length 68 [2019-11-15 23:59:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:51,122 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 39930 transitions. [2019-11-15 23:59:51,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 39930 transitions. [2019-11-15 23:59:51,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:51,129 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:51,129 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] [2019-11-15 23:59:51,130 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:51,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1823561743, now seen corresponding path program 1 times [2019-11-15 23:59:51,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:51,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824735926] [2019-11-15 23:59:51,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:51,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:51,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:51,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824735926] [2019-11-15 23:59:51,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:51,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:51,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150797160] [2019-11-15 23:59:51,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:51,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:51,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:51,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:51,192 INFO L87 Difference]: Start difference. First operand 14148 states and 39930 transitions. Second operand 4 states. [2019-11-15 23:59:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:51,623 INFO L93 Difference]: Finished difference Result 14460 states and 40606 transitions. [2019-11-15 23:59:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:59:51,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:59:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:51,640 INFO L225 Difference]: With dead ends: 14460 [2019-11-15 23:59:51,640 INFO L226 Difference]: Without dead ends: 13986 [2019-11-15 23:59:51,640 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-11-15 23:59:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13986 states. [2019-11-15 23:59:51,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13986 to 13425. [2019-11-15 23:59:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13425 states. [2019-11-15 23:59:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13425 states to 13425 states and 37675 transitions. [2019-11-15 23:59:51,816 INFO L78 Accepts]: Start accepts. Automaton has 13425 states and 37675 transitions. Word has length 68 [2019-11-15 23:59:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:51,816 INFO L462 AbstractCegarLoop]: Abstraction has 13425 states and 37675 transitions. [2019-11-15 23:59:51,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13425 states and 37675 transitions. [2019-11-15 23:59:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:51,823 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:51,824 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] [2019-11-15 23:59:51,824 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash -213049487, now seen corresponding path program 1 times [2019-11-15 23:59:51,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:51,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469127323] [2019-11-15 23:59:51,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:51,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:51,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:51,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469127323] [2019-11-15 23:59:51,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:51,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:59:51,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981224373] [2019-11-15 23:59:51,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:59:51,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:51,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:59:51,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:59:51,958 INFO L87 Difference]: Start difference. First operand 13425 states and 37675 transitions. Second operand 9 states. [2019-11-15 23:59:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:52,689 INFO L93 Difference]: Finished difference Result 19154 states and 53543 transitions. [2019-11-15 23:59:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:59:52,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-11-15 23:59:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:52,712 INFO L225 Difference]: With dead ends: 19154 [2019-11-15 23:59:52,712 INFO L226 Difference]: Without dead ends: 19154 [2019-11-15 23:59:52,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:59:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-11-15 23:59:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 15590. [2019-11-15 23:59:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15590 states. [2019-11-15 23:59:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15590 states to 15590 states and 43630 transitions. [2019-11-15 23:59:52,932 INFO L78 Accepts]: Start accepts. Automaton has 15590 states and 43630 transitions. Word has length 68 [2019-11-15 23:59:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:52,932 INFO L462 AbstractCegarLoop]: Abstraction has 15590 states and 43630 transitions. [2019-11-15 23:59:52,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:59:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15590 states and 43630 transitions. [2019-11-15 23:59:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:59:52,941 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:52,941 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] [2019-11-15 23:59:52,941 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:52,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 674454194, now seen corresponding path program 1 times [2019-11-15 23:59:52,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:52,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107726281] [2019-11-15 23:59:52,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:52,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:52,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:53,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107726281] [2019-11-15 23:59:53,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:53,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:53,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967404998] [2019-11-15 23:59:53,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:53,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:53,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:53,020 INFO L87 Difference]: Start difference. First operand 15590 states and 43630 transitions. Second operand 5 states. [2019-11-15 23:59:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:53,074 INFO L93 Difference]: Finished difference Result 4904 states and 11471 transitions. [2019-11-15 23:59:53,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:59:53,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-15 23:59:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:53,079 INFO L225 Difference]: With dead ends: 4904 [2019-11-15 23:59:53,079 INFO L226 Difference]: Without dead ends: 4032 [2019-11-15 23:59:53,080 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-11-15 23:59:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2019-11-15 23:59:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3409. [2019-11-15 23:59:53,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2019-11-15 23:59:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 7848 transitions. [2019-11-15 23:59:53,129 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 7848 transitions. Word has length 68 [2019-11-15 23:59:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:53,129 INFO L462 AbstractCegarLoop]: Abstraction has 3409 states and 7848 transitions. [2019-11-15 23:59:53,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 7848 transitions. [2019-11-15 23:59:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:53,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:53,134 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, 1, 1, 1] [2019-11-15 23:59:53,135 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:53,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1364067363, now seen corresponding path program 1 times [2019-11-15 23:59:53,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:53,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545337529] [2019-11-15 23:59:53,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:53,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545337529] [2019-11-15 23:59:53,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:53,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:59:53,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68285567] [2019-11-15 23:59:53,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:53,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:59:53,236 INFO L87 Difference]: Start difference. First operand 3409 states and 7848 transitions. Second operand 4 states. [2019-11-15 23:59:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:53,270 INFO L93 Difference]: Finished difference Result 3364 states and 7725 transitions. [2019-11-15 23:59:53,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:59:53,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 23:59:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:53,275 INFO L225 Difference]: With dead ends: 3364 [2019-11-15 23:59:53,275 INFO L226 Difference]: Without dead ends: 3364 [2019-11-15 23:59:53,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-11-15 23:59:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2982. [2019-11-15 23:59:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-11-15 23:59:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 6852 transitions. [2019-11-15 23:59:53,320 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 6852 transitions. Word has length 85 [2019-11-15 23:59:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:53,321 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 6852 transitions. [2019-11-15 23:59:53,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 6852 transitions. [2019-11-15 23:59:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:53,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:53,327 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, 1, 1, 1] [2019-11-15 23:59:53,329 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:53,329 INFO L82 PathProgramCache]: Analyzing trace with hash 623414397, now seen corresponding path program 1 times [2019-11-15 23:59:53,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:53,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468495697] [2019-11-15 23:59:53,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:53,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468495697] [2019-11-15 23:59:53,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:53,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:53,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538378102] [2019-11-15 23:59:53,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:53,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:53,480 INFO L87 Difference]: Start difference. First operand 2982 states and 6852 transitions. Second operand 5 states. [2019-11-15 23:59:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:53,525 INFO L93 Difference]: Finished difference Result 2982 states and 6843 transitions. [2019-11-15 23:59:53,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:59:53,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 23:59:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:53,529 INFO L225 Difference]: With dead ends: 2982 [2019-11-15 23:59:53,529 INFO L226 Difference]: Without dead ends: 2982 [2019-11-15 23:59:53,530 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-11-15 23:59:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2019-11-15 23:59:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2716. [2019-11-15 23:59:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-11-15 23:59:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 6246 transitions. [2019-11-15 23:59:53,566 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 6246 transitions. Word has length 85 [2019-11-15 23:59:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:53,566 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 6246 transitions. [2019-11-15 23:59:53,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 6246 transitions. [2019-11-15 23:59:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:53,570 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:53,570 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, 1, 1, 1] [2019-11-15 23:59:53,571 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:53,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1510918078, now seen corresponding path program 1 times [2019-11-15 23:59:53,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:53,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999355129] [2019-11-15 23:59:53,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:53,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:53,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999355129] [2019-11-15 23:59:53,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:53,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:59:53,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241747069] [2019-11-15 23:59:53,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:59:53,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:59:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:59:53,778 INFO L87 Difference]: Start difference. First operand 2716 states and 6246 transitions. Second operand 8 states. [2019-11-15 23:59:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:53,885 INFO L93 Difference]: Finished difference Result 4654 states and 10776 transitions. [2019-11-15 23:59:53,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:59:53,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-11-15 23:59:53,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:53,887 INFO L225 Difference]: With dead ends: 4654 [2019-11-15 23:59:53,887 INFO L226 Difference]: Without dead ends: 2027 [2019-11-15 23:59:53,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:59:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-11-15 23:59:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 2027. [2019-11-15 23:59:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-15 23:59:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 4676 transitions. [2019-11-15 23:59:53,904 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 4676 transitions. Word has length 85 [2019-11-15 23:59:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:53,904 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 4676 transitions. [2019-11-15 23:59:53,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:59:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 4676 transitions. [2019-11-15 23:59:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:53,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:53,906 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, 1, 1, 1] [2019-11-15 23:59:53,907 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:53,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1686345184, now seen corresponding path program 2 times [2019-11-15 23:59:53,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:53,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872001075] [2019-11-15 23:59:53,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:53,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:54,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872001075] [2019-11-15 23:59:54,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:54,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:59:54,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951130302] [2019-11-15 23:59:54,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:59:54,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:54,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:59:54,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:59:54,044 INFO L87 Difference]: Start difference. First operand 2027 states and 4676 transitions. Second operand 9 states. [2019-11-15 23:59:54,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:54,254 INFO L93 Difference]: Finished difference Result 3334 states and 7686 transitions. [2019-11-15 23:59:54,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:59:54,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-11-15 23:59:54,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:54,256 INFO L225 Difference]: With dead ends: 3334 [2019-11-15 23:59:54,256 INFO L226 Difference]: Without dead ends: 2227 [2019-11-15 23:59:54,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:59:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2019-11-15 23:59:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2082. [2019-11-15 23:59:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-15 23:59:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 4745 transitions. [2019-11-15 23:59:54,274 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 4745 transitions. Word has length 85 [2019-11-15 23:59:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:54,275 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 4745 transitions. [2019-11-15 23:59:54,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:59:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 4745 transitions. [2019-11-15 23:59:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:54,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:54,276 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, 1, 1, 1] [2019-11-15 23:59:54,277 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:54,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash -77951867, now seen corresponding path program 1 times [2019-11-15 23:59:54,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:54,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534559749] [2019-11-15 23:59:54,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:54,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534559749] [2019-11-15 23:59:54,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:54,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:59:54,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006848324] [2019-11-15 23:59:54,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:59:54,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:59:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:59:54,392 INFO L87 Difference]: Start difference. First operand 2082 states and 4745 transitions. Second operand 6 states. [2019-11-15 23:59:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:54,633 INFO L93 Difference]: Finished difference Result 2352 states and 5315 transitions. [2019-11-15 23:59:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:59:54,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-15 23:59:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:54,637 INFO L225 Difference]: With dead ends: 2352 [2019-11-15 23:59:54,637 INFO L226 Difference]: Without dead ends: 2312 [2019-11-15 23:59:54,637 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-11-15 23:59:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2019-11-15 23:59:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2029. [2019-11-15 23:59:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-11-15 23:59:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 4592 transitions. [2019-11-15 23:59:54,665 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 4592 transitions. Word has length 85 [2019-11-15 23:59:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:54,665 INFO L462 AbstractCegarLoop]: Abstraction has 2029 states and 4592 transitions. [2019-11-15 23:59:54,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:59:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 4592 transitions. [2019-11-15 23:59:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:54,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:54,677 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, 1, 1, 1] [2019-11-15 23:59:54,677 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:54,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:54,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2139806086, now seen corresponding path program 3 times [2019-11-15 23:59:54,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:54,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633547480] [2019-11-15 23:59:54,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:59:54,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633547480] [2019-11-15 23:59:54,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:54,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:59:54,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762579839] [2019-11-15 23:59:54,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:59:54,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:59:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:59:54,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:54,766 INFO L87 Difference]: Start difference. First operand 2029 states and 4592 transitions. Second operand 5 states. [2019-11-15 23:59:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:54,810 INFO L93 Difference]: Finished difference Result 2130 states and 4804 transitions. [2019-11-15 23:59:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:54,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-15 23:59:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:54,813 INFO L225 Difference]: With dead ends: 2130 [2019-11-15 23:59:54,813 INFO L226 Difference]: Without dead ends: 2130 [2019-11-15 23:59:54,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:59:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2019-11-15 23:59:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2097. [2019-11-15 23:59:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-11-15 23:59:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4734 transitions. [2019-11-15 23:59:54,839 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4734 transitions. Word has length 85 [2019-11-15 23:59:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:54,840 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 4734 transitions. [2019-11-15 23:59:54,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:59:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4734 transitions. [2019-11-15 23:59:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 23:59:54,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:54,843 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, 1, 1, 1] [2019-11-15 23:59:54,844 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -521050557, now seen corresponding path program 1 times [2019-11-15 23:59:54,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:59:54,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521212826] [2019-11-15 23:59:54,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:59:54,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:59:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:59:54,939 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:59:54,939 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:59:55,101 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:59:55,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:59:55 BasicIcfg [2019-11-15 23:59:55,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:59:55,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:59:55,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:59:55,105 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:59:55,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:59:23" (3/4) ... [2019-11-15 23:59:55,108 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:59:55,285 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_53c0d66f-1335-4e5b-b05f-83771cd1c6c4/bin/uautomizer/witness.graphml [2019-11-15 23:59:55,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:59:55,288 INFO L168 Benchmark]: Toolchain (without parser) took 33474.96 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 944.7 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,288 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:59:55,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,290 INFO L168 Benchmark]: Boogie Preprocessor took 83.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:59:55,290 INFO L168 Benchmark]: RCFGBuilder took 803.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,290 INFO L168 Benchmark]: TraceAbstraction took 31672.83 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 926.2 MB in the end (delta: 150.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,291 INFO L168 Benchmark]: Witness Printer took 180.77 ms. Allocated memory was 3.3 GB in the beginning and 4.0 GB in the end (delta: 789.6 MB). Free memory was 926.2 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 254.0 kB. Max. memory is 11.5 GB. [2019-11-15 23:59:55,293 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -186.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 803.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31672.83 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 1.1 GB in the beginning and 926.2 MB in the end (delta: 150.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 180.77 ms. Allocated memory was 3.3 GB in the beginning and 4.0 GB in the end (delta: 789.6 MB). Free memory was 926.2 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 254.0 kB. 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] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L799] 0 pthread_t t903; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L801] 0 pthread_t t904; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L736] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L736] 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) [L737] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L777] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L737] 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)) [L738] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L738] 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)) [L739] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L739] 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)) [L740] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L740] 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)) [L741] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L741] 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)) [L742] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z=1] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=1, z=1] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 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 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 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 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 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 [L815] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, 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=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 196 locations, 3 error locations. Result: UNSAFE, OverallTime: 31.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6498 SDtfs, 7528 SDslu, 14371 SDs, 0 SdLazy, 5617 SolverSat, 406 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57890occurred 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: 12.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 63804 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1777 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 329455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...