./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/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 87d99481adc4b254c0581b7f015ea09b865ac0c3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:43,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:43,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:43,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:43,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:43,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:43,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:43,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:43,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:43,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:43,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:43,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:43,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:43,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:43,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:43,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:43,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:43,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:43,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:43,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:43,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:43,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:43,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:43,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:43,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:43,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:43,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:43,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:43,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:43,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:43,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:43,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:43,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:43,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:43,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:43,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:43,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:43,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:43,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:43,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:43,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:43,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:49:43,964 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:43,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:43,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:43,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:43,966 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:43,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:43,967 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:49:43,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:43,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:49:43,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:43,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:49:43,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:49:43,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:49:43,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:49:43,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:43,969 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:43,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:49:43,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:43,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:43,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:49:43,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:49:43,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:49:43,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:43,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:49:43,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:49:43,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:43,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:49:43,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:49:43,974 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_eb6bb538-e570-4077-b547-736eb5e51d49/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 -> 87d99481adc4b254c0581b7f015ea09b865ac0c3 [2019-11-25 08:49:44,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:44,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:44,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:44,127 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:44,127 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:44,128 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i [2019-11-25 08:49:44,180 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/data/0d6d54d54/8ba97edf8c174178bab19db1d76ce88d/FLAGad2434888 [2019-11-25 08:49:44,679 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:44,679 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/sv-benchmarks/c/pthread-wmm/rfi004_pso.opt.i [2019-11-25 08:49:44,698 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/data/0d6d54d54/8ba97edf8c174178bab19db1d76ce88d/FLAGad2434888 [2019-11-25 08:49:45,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/data/0d6d54d54/8ba97edf8c174178bab19db1d76ce88d [2019-11-25 08:49:45,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:45,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:45,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:45,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:45,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:45,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507bfb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45, skipping insertion in model container [2019-11-25 08:49:45,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:45,207 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:45,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:45,700 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:45,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:45,813 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:45,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45 WrapperNode [2019-11-25 08:49:45,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:45,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:45,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:45,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:45,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:45,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:45,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:45,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:45,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... [2019-11-25 08:49:45,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:45,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:45,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:45,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:45,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/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-25 08:49:45,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:49:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:49:45,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:49:45,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:49:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:49:45,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:49:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:49:45,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:45,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:45,984 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-25 08:49:46,671 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:46,671 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:49:46,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:46 BoogieIcfgContainer [2019-11-25 08:49:46,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:46,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:49:46,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:49:46,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:49:46,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:49:45" (1/3) ... [2019-11-25 08:49:46,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89652f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:46, skipping insertion in model container [2019-11-25 08:49:46,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:45" (2/3) ... [2019-11-25 08:49:46,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89652f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:49:46, skipping insertion in model container [2019-11-25 08:49:46,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:46" (3/3) ... [2019-11-25 08:49:46,679 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.opt.i [2019-11-25 08:49:46,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,832 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,835 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:49:46,868 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:49:46,868 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:49:46,875 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:49:46,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:49:46,902 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:49:46,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:49:46,903 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:49:46,903 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:46,903 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:46,903 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:49:46,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:46,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:49:46,929 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 275 places, 351 transitions [2019-11-25 08:49:48,577 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-11-25 08:49:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-11-25 08:49:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:49:48,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:48,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:48,589 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:48,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1943573929, now seen corresponding path program 1 times [2019-11-25 08:49:48,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:48,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047419083] [2019-11-25 08:49:48,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:48,879 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-25 08:49:48,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047419083] [2019-11-25 08:49:48,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:48,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:48,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560448019] [2019-11-25 08:49:48,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:48,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:48,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:48,902 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-11-25 08:49:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:49,446 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-11-25 08:49:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:49,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-25 08:49:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:49,666 INFO L225 Difference]: With dead ends: 26617 [2019-11-25 08:49:49,667 INFO L226 Difference]: Without dead ends: 20361 [2019-11-25 08:49:49,668 INFO L630 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-25 08:49:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-11-25 08:49:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-11-25 08:49:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-11-25 08:49:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-11-25 08:49:50,839 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-11-25 08:49:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:50,840 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-11-25 08:49:50,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-11-25 08:49:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:49:50,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:50,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:50,850 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:50,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1839659959, now seen corresponding path program 1 times [2019-11-25 08:49:50,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910811914] [2019-11-25 08:49:50,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:50,944 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-25 08:49:50,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910811914] [2019-11-25 08:49:50,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:50,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:50,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015464880] [2019-11-25 08:49:50,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:50,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:50,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:50,947 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-11-25 08:49:51,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:51,905 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-11-25 08:49:51,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:51,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-11-25 08:49:51,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:52,035 INFO L225 Difference]: With dead ends: 31839 [2019-11-25 08:49:52,035 INFO L226 Difference]: Without dead ends: 31287 [2019-11-25 08:49:52,037 INFO L630 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-25 08:49:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-11-25 08:49:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-11-25 08:49:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-11-25 08:49:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-11-25 08:49:53,014 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-11-25 08:49:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:53,016 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-11-25 08:49:53,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-11-25 08:49:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:49:53,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:53,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:53,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:53,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:53,025 INFO L82 PathProgramCache]: Analyzing trace with hash -773334688, now seen corresponding path program 1 times [2019-11-25 08:49:53,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:53,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59041959] [2019-11-25 08:49:53,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:53,125 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-25 08:49:53,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59041959] [2019-11-25 08:49:53,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:53,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:53,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533084850] [2019-11-25 08:49:53,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:53,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:53,128 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-11-25 08:49:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:54,052 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-11-25 08:49:54,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:54,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-25 08:49:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:54,273 INFO L225 Difference]: With dead ends: 38697 [2019-11-25 08:49:54,274 INFO L226 Difference]: Without dead ends: 38249 [2019-11-25 08:49:54,275 INFO L630 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-25 08:49:54,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-11-25 08:49:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-11-25 08:49:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-11-25 08:49:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-11-25 08:49:55,702 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-11-25 08:49:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:55,702 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-11-25 08:49:55,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-11-25 08:49:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:49:55,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:55,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:55,709 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:55,710 INFO L82 PathProgramCache]: Analyzing trace with hash -397957574, now seen corresponding path program 1 times [2019-11-25 08:49:55,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:55,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652241149] [2019-11-25 08:49:55,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:55,753 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-25 08:49:55,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652241149] [2019-11-25 08:49:55,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:55,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:55,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816002961] [2019-11-25 08:49:55,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:55,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:55,754 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-11-25 08:49:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:55,962 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-11-25 08:49:55,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:55,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-25 08:49:55,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:56,067 INFO L225 Difference]: With dead ends: 42413 [2019-11-25 08:49:56,067 INFO L226 Difference]: Without dead ends: 42413 [2019-11-25 08:49:56,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-11-25 08:49:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-11-25 08:49:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-11-25 08:49:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-11-25 08:49:56,947 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-11-25 08:49:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:56,947 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-11-25 08:49:56,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-11-25 08:49:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:49:56,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:56,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:56,963 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash 345440143, now seen corresponding path program 1 times [2019-11-25 08:49:56,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:56,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291734050] [2019-11-25 08:49:56,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:57,065 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-25 08:49:57,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291734050] [2019-11-25 08:49:57,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:57,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:57,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255526101] [2019-11-25 08:49:57,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:57,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:57,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:57,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:57,068 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 6 states. [2019-11-25 08:49:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:58,392 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-11-25 08:49:58,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:49:58,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-25 08:49:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:58,487 INFO L225 Difference]: With dead ends: 48757 [2019-11-25 08:49:58,487 INFO L226 Difference]: Without dead ends: 48237 [2019-11-25 08:49:58,488 INFO L630 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-25 08:49:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-11-25 08:49:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-11-25 08:49:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-11-25 08:49:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-11-25 08:49:59,229 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-11-25 08:49:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:59,229 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-11-25 08:49:59,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-11-25 08:49:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:49:59,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:59,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:59,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:49:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2068573748, now seen corresponding path program 1 times [2019-11-25 08:49:59,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:59,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784473503] [2019-11-25 08:49:59,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:59,371 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-25 08:49:59,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784473503] [2019-11-25 08:49:59,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:59,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:59,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830064353] [2019-11-25 08:49:59,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:59,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:59,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:59,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:59,375 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-11-25 08:50:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:00,616 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-11-25 08:50:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:00,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-11-25 08:50:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:00,719 INFO L225 Difference]: With dead ends: 53006 [2019-11-25 08:50:00,719 INFO L226 Difference]: Without dead ends: 52030 [2019-11-25 08:50:00,720 INFO L630 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-25 08:50:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-11-25 08:50:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-11-25 08:50:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-11-25 08:50:01,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-11-25 08:50:01,541 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-11-25 08:50:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:01,541 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-11-25 08:50:01,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-11-25 08:50:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:50:01,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:01,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:01,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash 271622389, now seen corresponding path program 1 times [2019-11-25 08:50:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186013405] [2019-11-25 08:50:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:01,667 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-25 08:50:01,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186013405] [2019-11-25 08:50:01,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:01,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:01,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861515020] [2019-11-25 08:50:01,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:01,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:01,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:01,669 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-11-25 08:50:02,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:02,765 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-11-25 08:50:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:02,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-11-25 08:50:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:02,907 INFO L225 Difference]: With dead ends: 70898 [2019-11-25 08:50:02,907 INFO L226 Difference]: Without dead ends: 70898 [2019-11-25 08:50:02,907 INFO L630 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-25 08:50:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-11-25 08:50:04,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-11-25 08:50:04,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-11-25 08:50:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-11-25 08:50:04,404 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-11-25 08:50:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:04,405 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-11-25 08:50:04,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-11-25 08:50:04,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-25 08:50:04,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:04,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:04,417 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:04,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1159126070, now seen corresponding path program 1 times [2019-11-25 08:50:04,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:04,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360409660] [2019-11-25 08:50:04,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:04,470 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-25 08:50:04,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360409660] [2019-11-25 08:50:04,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:04,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:04,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591850964] [2019-11-25 08:50:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:04,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:04,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:04,472 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 3 states. [2019-11-25 08:50:04,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:04,648 INFO L93 Difference]: Finished difference Result 43857 states and 152834 transitions. [2019-11-25 08:50:04,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:04,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-25 08:50:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:04,725 INFO L225 Difference]: With dead ends: 43857 [2019-11-25 08:50:04,725 INFO L226 Difference]: Without dead ends: 43353 [2019-11-25 08:50:04,725 INFO L630 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-25 08:50:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43353 states. [2019-11-25 08:50:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43353 to 41887. [2019-11-25 08:50:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41887 states. [2019-11-25 08:50:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41887 states to 41887 states and 146705 transitions. [2019-11-25 08:50:05,426 INFO L78 Accepts]: Start accepts. Automaton has 41887 states and 146705 transitions. Word has length 55 [2019-11-25 08:50:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:05,426 INFO L462 AbstractCegarLoop]: Abstraction has 41887 states and 146705 transitions. [2019-11-25 08:50:05,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 41887 states and 146705 transitions. [2019-11-25 08:50:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:50:05,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:05,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:05,437 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1391336095, now seen corresponding path program 1 times [2019-11-25 08:50:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:05,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003581157] [2019-11-25 08:50:05,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:05,551 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-25 08:50:05,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003581157] [2019-11-25 08:50:05,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:05,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:05,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717721482] [2019-11-25 08:50:05,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:05,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:05,557 INFO L87 Difference]: Start difference. First operand 41887 states and 146705 transitions. Second operand 6 states. [2019-11-25 08:50:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:06,562 INFO L93 Difference]: Finished difference Result 54550 states and 184835 transitions. [2019-11-25 08:50:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:06,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-25 08:50:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:06,663 INFO L225 Difference]: With dead ends: 54550 [2019-11-25 08:50:06,664 INFO L226 Difference]: Without dead ends: 54550 [2019-11-25 08:50:06,664 INFO L630 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-25 08:50:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54550 states. [2019-11-25 08:50:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54550 to 45862. [2019-11-25 08:50:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45862 states. [2019-11-25 08:50:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45862 states to 45862 states and 158168 transitions. [2019-11-25 08:50:07,457 INFO L78 Accepts]: Start accepts. Automaton has 45862 states and 158168 transitions. Word has length 56 [2019-11-25 08:50:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,457 INFO L462 AbstractCegarLoop]: Abstraction has 45862 states and 158168 transitions. [2019-11-25 08:50:07,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 45862 states and 158168 transitions. [2019-11-25 08:50:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 08:50:07,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:07,467 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2016127520, now seen corresponding path program 1 times [2019-11-25 08:50:07,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523145981] [2019-11-25 08:50:07,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,545 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-25 08:50:07,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523145981] [2019-11-25 08:50:07,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:07,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885168542] [2019-11-25 08:50:07,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:07,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:07,546 INFO L87 Difference]: Start difference. First operand 45862 states and 158168 transitions. Second operand 4 states. [2019-11-25 08:50:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,602 INFO L93 Difference]: Finished difference Result 8164 states and 24872 transitions. [2019-11-25 08:50:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:07,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-25 08:50:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,614 INFO L225 Difference]: With dead ends: 8164 [2019-11-25 08:50:07,614 INFO L226 Difference]: Without dead ends: 6755 [2019-11-25 08:50:07,615 INFO L630 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-25 08:50:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2019-11-25 08:50:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6707. [2019-11-25 08:50:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6707 states. [2019-11-25 08:50:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 20041 transitions. [2019-11-25 08:50:07,696 INFO L78 Accepts]: Start accepts. Automaton has 6707 states and 20041 transitions. Word has length 56 [2019-11-25 08:50:07,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:07,697 INFO L462 AbstractCegarLoop]: Abstraction has 6707 states and 20041 transitions. [2019-11-25 08:50:07,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 6707 states and 20041 transitions. [2019-11-25 08:50:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 08:50:07,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:07,700 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:07,700 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1758957222, now seen corresponding path program 1 times [2019-11-25 08:50:07,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:07,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789288225] [2019-11-25 08:50:07,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:07,746 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-25 08:50:07,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789288225] [2019-11-25 08:50:07,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:07,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:07,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387029141] [2019-11-25 08:50:07,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:07,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:07,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:07,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:07,748 INFO L87 Difference]: Start difference. First operand 6707 states and 20041 transitions. Second operand 4 states. [2019-11-25 08:50:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:07,879 INFO L93 Difference]: Finished difference Result 7892 states and 23390 transitions. [2019-11-25 08:50:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:07,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-25 08:50:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:07,892 INFO L225 Difference]: With dead ends: 7892 [2019-11-25 08:50:07,892 INFO L226 Difference]: Without dead ends: 7892 [2019-11-25 08:50:07,892 INFO L630 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-25 08:50:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2019-11-25 08:50:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7214. [2019-11-25 08:50:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7214 states. [2019-11-25 08:50:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 21447 transitions. [2019-11-25 08:50:08,000 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 21447 transitions. Word has length 65 [2019-11-25 08:50:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,000 INFO L462 AbstractCegarLoop]: Abstraction has 7214 states and 21447 transitions. [2019-11-25 08:50:08,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 21447 transitions. [2019-11-25 08:50:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 08:50:08,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,004 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash -793199739, now seen corresponding path program 1 times [2019-11-25 08:50:08,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817498792] [2019-11-25 08:50:08,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,111 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-25 08:50:08,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817498792] [2019-11-25 08:50:08,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:08,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676863397] [2019-11-25 08:50:08,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:08,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:08,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:08,115 INFO L87 Difference]: Start difference. First operand 7214 states and 21447 transitions. Second operand 6 states. [2019-11-25 08:50:08,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,482 INFO L93 Difference]: Finished difference Result 9269 states and 27196 transitions. [2019-11-25 08:50:08,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:08,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-25 08:50:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,497 INFO L225 Difference]: With dead ends: 9269 [2019-11-25 08:50:08,497 INFO L226 Difference]: Without dead ends: 9221 [2019-11-25 08:50:08,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:50:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2019-11-25 08:50:08,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 8053. [2019-11-25 08:50:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8053 states. [2019-11-25 08:50:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8053 states to 8053 states and 23827 transitions. [2019-11-25 08:50:08,609 INFO L78 Accepts]: Start accepts. Automaton has 8053 states and 23827 transitions. Word has length 65 [2019-11-25 08:50:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:08,609 INFO L462 AbstractCegarLoop]: Abstraction has 8053 states and 23827 transitions. [2019-11-25 08:50:08,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8053 states and 23827 transitions. [2019-11-25 08:50:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:08,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:08,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:08,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2143354213, now seen corresponding path program 1 times [2019-11-25 08:50:08,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:08,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510505724] [2019-11-25 08:50:08,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:08,673 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-25 08:50:08,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510505724] [2019-11-25 08:50:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:08,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109191652] [2019-11-25 08:50:08,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:08,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:08,675 INFO L87 Difference]: Start difference. First operand 8053 states and 23827 transitions. Second operand 4 states. [2019-11-25 08:50:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:08,927 INFO L93 Difference]: Finished difference Result 10666 states and 31176 transitions. [2019-11-25 08:50:08,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:50:08,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:50:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:08,944 INFO L225 Difference]: With dead ends: 10666 [2019-11-25 08:50:08,944 INFO L226 Difference]: Without dead ends: 10666 [2019-11-25 08:50:08,944 INFO L630 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-25 08:50:08,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2019-11-25 08:50:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 9076. [2019-11-25 08:50:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9076 states. [2019-11-25 08:50:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 26646 transitions. [2019-11-25 08:50:09,064 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 26646 transitions. Word has length 69 [2019-11-25 08:50:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,064 INFO L462 AbstractCegarLoop]: Abstraction has 9076 states and 26646 transitions. [2019-11-25 08:50:09,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 26646 transitions. [2019-11-25 08:50:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:09,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,071 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,071 INFO L82 PathProgramCache]: Analyzing trace with hash -906848602, now seen corresponding path program 1 times [2019-11-25 08:50:09,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789941907] [2019-11-25 08:50:09,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,157 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-25 08:50:09,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789941907] [2019-11-25 08:50:09,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:09,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811192434] [2019-11-25 08:50:09,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:09,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:09,158 INFO L87 Difference]: Start difference. First operand 9076 states and 26646 transitions. Second operand 6 states. [2019-11-25 08:50:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:09,640 INFO L93 Difference]: Finished difference Result 10386 states and 29897 transitions. [2019-11-25 08:50:09,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:50:09,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-25 08:50:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:09,651 INFO L225 Difference]: With dead ends: 10386 [2019-11-25 08:50:09,652 INFO L226 Difference]: Without dead ends: 10386 [2019-11-25 08:50:09,652 INFO L630 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-25 08:50:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2019-11-25 08:50:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 10083. [2019-11-25 08:50:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10083 states. [2019-11-25 08:50:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10083 states to 10083 states and 29120 transitions. [2019-11-25 08:50:09,768 INFO L78 Accepts]: Start accepts. Automaton has 10083 states and 29120 transitions. Word has length 69 [2019-11-25 08:50:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:09,769 INFO L462 AbstractCegarLoop]: Abstraction has 10083 states and 29120 transitions. [2019-11-25 08:50:09,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 10083 states and 29120 transitions. [2019-11-25 08:50:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:09,776 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:09,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:09,776 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1310909351, now seen corresponding path program 1 times [2019-11-25 08:50:09,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:09,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207961044] [2019-11-25 08:50:09,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:09,893 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-25 08:50:09,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207961044] [2019-11-25 08:50:09,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:09,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:09,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135450515] [2019-11-25 08:50:09,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:09,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:09,894 INFO L87 Difference]: Start difference. First operand 10083 states and 29120 transitions. Second operand 6 states. [2019-11-25 08:50:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,270 INFO L93 Difference]: Finished difference Result 12000 states and 33627 transitions. [2019-11-25 08:50:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:50:10,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-25 08:50:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,288 INFO L225 Difference]: With dead ends: 12000 [2019-11-25 08:50:10,288 INFO L226 Difference]: Without dead ends: 12000 [2019-11-25 08:50:10,288 INFO L630 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-25 08:50:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12000 states. [2019-11-25 08:50:10,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12000 to 10302. [2019-11-25 08:50:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2019-11-25 08:50:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 29172 transitions. [2019-11-25 08:50:10,503 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 29172 transitions. Word has length 69 [2019-11-25 08:50:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:10,503 INFO L462 AbstractCegarLoop]: Abstraction has 10302 states and 29172 transitions. [2019-11-25 08:50:10,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 29172 transitions. [2019-11-25 08:50:10,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:10,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:10,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:10,514 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1522260264, now seen corresponding path program 1 times [2019-11-25 08:50:10,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:10,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362810671] [2019-11-25 08:50:10,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:10,585 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-25 08:50:10,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362810671] [2019-11-25 08:50:10,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:10,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:10,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942994272] [2019-11-25 08:50:10,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:10,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:10,587 INFO L87 Difference]: Start difference. First operand 10302 states and 29172 transitions. Second operand 5 states. [2019-11-25 08:50:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:10,894 INFO L93 Difference]: Finished difference Result 12577 states and 35465 transitions. [2019-11-25 08:50:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:10,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-25 08:50:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:10,914 INFO L225 Difference]: With dead ends: 12577 [2019-11-25 08:50:10,915 INFO L226 Difference]: Without dead ends: 12577 [2019-11-25 08:50:10,915 INFO L630 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-25 08:50:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12577 states. [2019-11-25 08:50:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12577 to 11077. [2019-11-25 08:50:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11077 states. [2019-11-25 08:50:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11077 states to 11077 states and 31106 transitions. [2019-11-25 08:50:11,061 INFO L78 Accepts]: Start accepts. Automaton has 11077 states and 31106 transitions. Word has length 69 [2019-11-25 08:50:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,061 INFO L462 AbstractCegarLoop]: Abstraction has 11077 states and 31106 transitions. [2019-11-25 08:50:11,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11077 states and 31106 transitions. [2019-11-25 08:50:11,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:11,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,068 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1011726087, now seen corresponding path program 1 times [2019-11-25 08:50:11,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23978679] [2019-11-25 08:50:11,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,116 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-25 08:50:11,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23978679] [2019-11-25 08:50:11,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:50:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754903955] [2019-11-25 08:50:11,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:50:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:50:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:50:11,119 INFO L87 Difference]: Start difference. First operand 11077 states and 31106 transitions. Second operand 4 states. [2019-11-25 08:50:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,505 INFO L93 Difference]: Finished difference Result 13633 states and 38381 transitions. [2019-11-25 08:50:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:11,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:50:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,523 INFO L225 Difference]: With dead ends: 13633 [2019-11-25 08:50:11,523 INFO L226 Difference]: Without dead ends: 13258 [2019-11-25 08:50:11,524 INFO L630 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-25 08:50:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13258 states. [2019-11-25 08:50:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13258 to 12715. [2019-11-25 08:50:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12715 states. [2019-11-25 08:50:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12715 states to 12715 states and 35690 transitions. [2019-11-25 08:50:11,755 INFO L78 Accepts]: Start accepts. Automaton has 12715 states and 35690 transitions. Word has length 69 [2019-11-25 08:50:11,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,755 INFO L462 AbstractCegarLoop]: Abstraction has 12715 states and 35690 transitions. [2019-11-25 08:50:11,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:50:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 12715 states and 35690 transitions. [2019-11-25 08:50:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:50:11,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,766 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -785225272, now seen corresponding path program 1 times [2019-11-25 08:50:11,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127130602] [2019-11-25 08:50:11,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:11,883 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-25 08:50:11,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127130602] [2019-11-25 08:50:11,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:11,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:11,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881602349] [2019-11-25 08:50:11,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:11,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:11,888 INFO L87 Difference]: Start difference. First operand 12715 states and 35690 transitions. Second operand 5 states. [2019-11-25 08:50:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:11,931 INFO L93 Difference]: Finished difference Result 4450 states and 10431 transitions. [2019-11-25 08:50:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:11,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-11-25 08:50:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:11,935 INFO L225 Difference]: With dead ends: 4450 [2019-11-25 08:50:11,935 INFO L226 Difference]: Without dead ends: 3692 [2019-11-25 08:50:11,935 INFO L630 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-25 08:50:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2019-11-25 08:50:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3206. [2019-11-25 08:50:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2019-11-25 08:50:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 7382 transitions. [2019-11-25 08:50:11,967 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 7382 transitions. Word has length 69 [2019-11-25 08:50:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:11,967 INFO L462 AbstractCegarLoop]: Abstraction has 3206 states and 7382 transitions. [2019-11-25 08:50:11,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 7382 transitions. [2019-11-25 08:50:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:11,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:11,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:11,970 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash 108174986, now seen corresponding path program 1 times [2019-11-25 08:50:11,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:11,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060098380] [2019-11-25 08:50:11,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,083 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-25 08:50:12,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060098380] [2019-11-25 08:50:12,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:12,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108620908] [2019-11-25 08:50:12,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:12,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:12,084 INFO L87 Difference]: Start difference. First operand 3206 states and 7382 transitions. Second operand 7 states. [2019-11-25 08:50:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:12,629 INFO L93 Difference]: Finished difference Result 4002 states and 9079 transitions. [2019-11-25 08:50:12,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:50:12,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:50:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:12,633 INFO L225 Difference]: With dead ends: 4002 [2019-11-25 08:50:12,633 INFO L226 Difference]: Without dead ends: 3960 [2019-11-25 08:50:12,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:50:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3960 states. [2019-11-25 08:50:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3960 to 3401. [2019-11-25 08:50:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2019-11-25 08:50:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 7793 transitions. [2019-11-25 08:50:12,667 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 7793 transitions. Word has length 86 [2019-11-25 08:50:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:12,667 INFO L462 AbstractCegarLoop]: Abstraction has 3401 states and 7793 transitions. [2019-11-25 08:50:12,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 7793 transitions. [2019-11-25 08:50:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:12,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:12,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:12,670 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:12,670 INFO L82 PathProgramCache]: Analyzing trace with hash 338451179, now seen corresponding path program 1 times [2019-11-25 08:50:12,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:12,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582461281] [2019-11-25 08:50:12,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:12,746 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-25 08:50:12,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582461281] [2019-11-25 08:50:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:12,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:12,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871221685] [2019-11-25 08:50:12,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:12,749 INFO L87 Difference]: Start difference. First operand 3401 states and 7793 transitions. Second operand 6 states. [2019-11-25 08:50:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,169 INFO L93 Difference]: Finished difference Result 4267 states and 9665 transitions. [2019-11-25 08:50:13,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:50:13,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:50:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,173 INFO L225 Difference]: With dead ends: 4267 [2019-11-25 08:50:13,174 INFO L226 Difference]: Without dead ends: 4267 [2019-11-25 08:50:13,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:13,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2019-11-25 08:50:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 3382. [2019-11-25 08:50:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-25 08:50:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 7752 transitions. [2019-11-25 08:50:13,211 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 7752 transitions. Word has length 86 [2019-11-25 08:50:13,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,211 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 7752 transitions. [2019-11-25 08:50:13,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 7752 transitions. [2019-11-25 08:50:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:13,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,216 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1969034357, now seen corresponding path program 1 times [2019-11-25 08:50:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007834546] [2019-11-25 08:50:13,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,353 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-25 08:50:13,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007834546] [2019-11-25 08:50:13,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:13,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198164578] [2019-11-25 08:50:13,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:13,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:13,356 INFO L87 Difference]: Start difference. First operand 3382 states and 7752 transitions. Second operand 7 states. [2019-11-25 08:50:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,591 INFO L93 Difference]: Finished difference Result 3915 states and 8859 transitions. [2019-11-25 08:50:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:50:13,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:50:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,595 INFO L225 Difference]: With dead ends: 3915 [2019-11-25 08:50:13,595 INFO L226 Difference]: Without dead ends: 3915 [2019-11-25 08:50:13,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2019-11-25 08:50:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3255. [2019-11-25 08:50:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2019-11-25 08:50:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 7419 transitions. [2019-11-25 08:50:13,626 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 7419 transitions. Word has length 86 [2019-11-25 08:50:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,627 INFO L462 AbstractCegarLoop]: Abstraction has 3255 states and 7419 transitions. [2019-11-25 08:50:13,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 7419 transitions. [2019-11-25 08:50:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:13,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,630 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,630 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1081530676, now seen corresponding path program 1 times [2019-11-25 08:50:13,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992278032] [2019-11-25 08:50:13,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,752 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-25 08:50:13,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992278032] [2019-11-25 08:50:13,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:50:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246940101] [2019-11-25 08:50:13,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:50:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:50:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:50:13,754 INFO L87 Difference]: Start difference. First operand 3255 states and 7419 transitions. Second operand 7 states. [2019-11-25 08:50:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,866 INFO L93 Difference]: Finished difference Result 5459 states and 12528 transitions. [2019-11-25 08:50:13,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:13,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:50:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,870 INFO L225 Difference]: With dead ends: 5459 [2019-11-25 08:50:13,870 INFO L226 Difference]: Without dead ends: 2296 [2019-11-25 08:50:13,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:50:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-11-25 08:50:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2019-11-25 08:50:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-11-25 08:50:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 5260 transitions. [2019-11-25 08:50:13,899 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 5260 transitions. Word has length 86 [2019-11-25 08:50:13,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,899 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 5260 transitions. [2019-11-25 08:50:13,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:50:13,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 5260 transitions. [2019-11-25 08:50:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:13,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,903 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1159109540, now seen corresponding path program 1 times [2019-11-25 08:50:13,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537698288] [2019-11-25 08:50:13,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:13,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537698288] [2019-11-25 08:50:13,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:50:13,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266420374] [2019-11-25 08:50:13,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:50:13,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:50:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:50:13,989 INFO L87 Difference]: Start difference. First operand 2296 states and 5260 transitions. Second operand 5 states. [2019-11-25 08:50:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,192 INFO L93 Difference]: Finished difference Result 2595 states and 5879 transitions. [2019-11-25 08:50:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:50:14,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:50:14,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,195 INFO L225 Difference]: With dead ends: 2595 [2019-11-25 08:50:14,195 INFO L226 Difference]: Without dead ends: 2573 [2019-11-25 08:50:14,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-11-25 08:50:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2320. [2019-11-25 08:50:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2019-11-25 08:50:14,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 5317 transitions. [2019-11-25 08:50:14,221 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 5317 transitions. Word has length 86 [2019-11-25 08:50:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,222 INFO L462 AbstractCegarLoop]: Abstraction has 2320 states and 5317 transitions. [2019-11-25 08:50:14,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:50:14,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 5317 transitions. [2019-11-25 08:50:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:14,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,224 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1679742362, now seen corresponding path program 2 times [2019-11-25 08:50:14,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732289202] [2019-11-25 08:50:14,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,316 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-25 08:50:14,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732289202] [2019-11-25 08:50:14,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:14,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293118919] [2019-11-25 08:50:14,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:14,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:14,318 INFO L87 Difference]: Start difference. First operand 2320 states and 5317 transitions. Second operand 6 states. [2019-11-25 08:50:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,529 INFO L93 Difference]: Finished difference Result 2521 states and 5753 transitions. [2019-11-25 08:50:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:50:14,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:50:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,531 INFO L225 Difference]: With dead ends: 2521 [2019-11-25 08:50:14,531 INFO L226 Difference]: Without dead ends: 2521 [2019-11-25 08:50:14,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2019-11-25 08:50:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 2262. [2019-11-25 08:50:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-11-25 08:50:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 5195 transitions. [2019-11-25 08:50:14,550 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 5195 transitions. Word has length 86 [2019-11-25 08:50:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,551 INFO L462 AbstractCegarLoop]: Abstraction has 2262 states and 5195 transitions. [2019-11-25 08:50:14,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 5195 transitions. [2019-11-25 08:50:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:14,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,553 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,553 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1351489726, now seen corresponding path program 3 times [2019-11-25 08:50:14,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763129270] [2019-11-25 08:50:14,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,653 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-25 08:50:14,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763129270] [2019-11-25 08:50:14,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:50:14,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259357691] [2019-11-25 08:50:14,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:50:14,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:50:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:50:14,656 INFO L87 Difference]: Start difference. First operand 2262 states and 5195 transitions. Second operand 6 states. [2019-11-25 08:50:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,844 INFO L93 Difference]: Finished difference Result 2544 states and 5784 transitions. [2019-11-25 08:50:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:50:14,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:50:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,846 INFO L225 Difference]: With dead ends: 2544 [2019-11-25 08:50:14,846 INFO L226 Difference]: Without dead ends: 2486 [2019-11-25 08:50:14,846 INFO L630 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-25 08:50:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-11-25 08:50:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2213. [2019-11-25 08:50:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-11-25 08:50:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 5039 transitions. [2019-11-25 08:50:14,866 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 5039 transitions. Word has length 86 [2019-11-25 08:50:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,866 INFO L462 AbstractCegarLoop]: Abstraction has 2213 states and 5039 transitions. [2019-11-25 08:50:14,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:50:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 5039 transitions. [2019-11-25 08:50:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:14,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,870 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1000689789, now seen corresponding path program 2 times [2019-11-25 08:50:14,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530418099] [2019-11-25 08:50:14,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:15,019 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-25 08:50:15,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530418099] [2019-11-25 08:50:15,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:15,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:50:15,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538369436] [2019-11-25 08:50:15,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:50:15,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:50:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:50:15,021 INFO L87 Difference]: Start difference. First operand 2213 states and 5039 transitions. Second operand 8 states. [2019-11-25 08:50:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:15,339 INFO L93 Difference]: Finished difference Result 2498 states and 5648 transitions. [2019-11-25 08:50:15,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:50:15,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-11-25 08:50:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:15,343 INFO L225 Difference]: With dead ends: 2498 [2019-11-25 08:50:15,343 INFO L226 Difference]: Without dead ends: 2498 [2019-11-25 08:50:15,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:50:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-11-25 08:50:15,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2254. [2019-11-25 08:50:15,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-25 08:50:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 5127 transitions. [2019-11-25 08:50:15,372 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 5127 transitions. Word has length 86 [2019-11-25 08:50:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:15,373 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 5127 transitions. [2019-11-25 08:50:15,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:50:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 5127 transitions. [2019-11-25 08:50:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:15,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:15,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:15,376 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:15,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:15,376 INFO L82 PathProgramCache]: Analyzing trace with hash -113186108, now seen corresponding path program 2 times [2019-11-25 08:50:15,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:15,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184819836] [2019-11-25 08:50:15,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:15,531 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-25 08:50:15,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184819836] [2019-11-25 08:50:15,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:15,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:50:15,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047943028] [2019-11-25 08:50:15,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:50:15,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:15,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:50:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:50:15,534 INFO L87 Difference]: Start difference. First operand 2254 states and 5127 transitions. Second operand 10 states. [2019-11-25 08:50:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:15,887 INFO L93 Difference]: Finished difference Result 3849 states and 8727 transitions. [2019-11-25 08:50:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:50:15,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-11-25 08:50:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:15,890 INFO L225 Difference]: With dead ends: 3849 [2019-11-25 08:50:15,891 INFO L226 Difference]: Without dead ends: 2517 [2019-11-25 08:50:15,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:50:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2019-11-25 08:50:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2287. [2019-11-25 08:50:15,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2019-11-25 08:50:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 5152 transitions. [2019-11-25 08:50:15,922 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 5152 transitions. Word has length 86 [2019-11-25 08:50:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:15,922 INFO L462 AbstractCegarLoop]: Abstraction has 2287 states and 5152 transitions. [2019-11-25 08:50:15,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:50:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 5152 transitions. [2019-11-25 08:50:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:50:15,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:15,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:15,925 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash -466190110, now seen corresponding path program 3 times [2019-11-25 08:50:15,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:15,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219855364] [2019-11-25 08:50:15,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:50:16,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:50:16,017 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:50:16,206 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:50:16,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:16 BasicIcfg [2019-11-25 08:50:16,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:16,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:16,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:16,216 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:16,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:46" (3/4) ... [2019-11-25 08:50:16,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:50:16,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_eb6bb538-e570-4077-b547-736eb5e51d49/bin/uautomizer/witness.graphml [2019-11-25 08:50:16,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:16,379 INFO L168 Benchmark]: Toolchain (without parser) took 31226.49 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 939.4 MB in the beginning and 1.4 GB in the end (delta: -504.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,380 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:16,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,380 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.59 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,381 INFO L168 Benchmark]: Boogie Preprocessor took 39.33 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-25 08:50:16,381 INFO L168 Benchmark]: RCFGBuilder took 763.39 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: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,381 INFO L168 Benchmark]: TraceAbstraction took 29541.88 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -442.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,382 INFO L168 Benchmark]: Witness Printer took 161.85 ms. Allocated memory is still 3.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:16,385 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 661.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.59 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.33 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 763.39 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: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29541.88 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -442.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 161.85 ms. Allocated memory is still 3.3 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 54.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [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] [L707] 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, y=0] [L708] 0 _Bool y$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, y=0, y$flush_delayed=0] [L709] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1655; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1655, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1656; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1656, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y 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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$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 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y 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, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y 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, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 329 locations, 5 error locations. Result: UNSAFE, OverallTime: 29.3s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6795 SDtfs, 7868 SDslu, 15842 SDs, 0 SdLazy, 6074 SolverSat, 364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 69 SyntacticMatches, 18 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred 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: 10.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 59417 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1924 NumberOfCodeBlocks, 1924 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1811 ConstructedInterpolants, 0 QuantifiedInterpolants, 351280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...