./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/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 9356c038883eaf32b3f62e36a61d1d73667dc10d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:55:29,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:29,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:29,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:29,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:29,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:29,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:29,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:29,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:29,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:29,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:29,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:29,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:29,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:29,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:29,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:29,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:29,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:29,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:29,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:29,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:29,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:29,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:29,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:29,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:29,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:29,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:29,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:29,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:29,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:29,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:29,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:29,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:29,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:29,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:29,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:29,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:29,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:29,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:29,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:29,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:29,155 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:55:29,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:29,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:29,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:29,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:29,179 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:29,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:55:29,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:29,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:55:29,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:29,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:29,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:29,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:55:29,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:29,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:29,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:29,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:29,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:29,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:29,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:29,183 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:55:29,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:29,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:55:29,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:55:29,183 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_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/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 -> 9356c038883eaf32b3f62e36a61d1d73667dc10d [2019-11-25 08:55:29,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:29,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:29,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:29,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:29,359 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:29,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-11-25 08:55:29,420 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/data/45e5c03ac/6ecb5d6f066347b6b28cedb0fe6839be/FLAG9c2f8602e [2019-11-25 08:55:29,871 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:29,872 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/sv-benchmarks/c/pthread-wmm/safe033_pso.oepc.i [2019-11-25 08:55:29,885 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/data/45e5c03ac/6ecb5d6f066347b6b28cedb0fe6839be/FLAG9c2f8602e [2019-11-25 08:55:30,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/data/45e5c03ac/6ecb5d6f066347b6b28cedb0fe6839be [2019-11-25 08:55:30,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:30,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:30,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:30,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:30,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:30,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d582710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30, skipping insertion in model container [2019-11-25 08:55:30,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:30,217 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:30,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:30,662 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:30,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:30,808 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:30,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30 WrapperNode [2019-11-25 08:55:30,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:30,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:30,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:30,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:30,817 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:55:30" (1/1) ... [2019-11-25 08:55:30,847 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:55:30" (1/1) ... [2019-11-25 08:55:30,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:30,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:30,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:30,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:30,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... [2019-11-25 08:55:30,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:30,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:30,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:30,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:30,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/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:55:30,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:55:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:55:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:55:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:55:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:55:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:55:30,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:55:30,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:55:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:55:30,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:30,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:30,973 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:55:31,538 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:31,538 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:55:31,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:31 BoogieIcfgContainer [2019-11-25 08:55:31,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:31,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:31,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:31,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:31,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:30" (1/3) ... [2019-11-25 08:55:31,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8ff3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:31, skipping insertion in model container [2019-11-25 08:55:31,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:30" (2/3) ... [2019-11-25 08:55:31,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d8ff3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:31, skipping insertion in model container [2019-11-25 08:55:31,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:31" (3/3) ... [2019-11-25 08:55:31,546 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc.i [2019-11-25 08:55:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,648 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,674 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,698 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,703 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:55:31,729 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:55:31,729 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:31,739 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:55:31,749 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:55:31,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:31,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:55:31,771 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:31,771 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:31,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:31,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:31,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:31,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:31,797 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 272 places, 348 transitions [2019-11-25 08:55:33,448 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25974 states. [2019-11-25 08:55:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states. [2019-11-25 08:55:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:55:33,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:33,460 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] [2019-11-25 08:55:33,461 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:55:33,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1129759359, now seen corresponding path program 1 times [2019-11-25 08:55:33,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:33,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287591684] [2019-11-25 08:55:33,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:33,716 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:55:33,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287591684] [2019-11-25 08:55:33,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:33,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:33,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858057885] [2019-11-25 08:55:33,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:33,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:33,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:33,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:33,737 INFO L87 Difference]: Start difference. First operand 25974 states. Second operand 4 states. [2019-11-25 08:55:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:34,507 INFO L93 Difference]: Finished difference Result 26614 states and 102119 transitions. [2019-11-25 08:55:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:34,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-25 08:55:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:34,723 INFO L225 Difference]: With dead ends: 26614 [2019-11-25 08:55:34,723 INFO L226 Difference]: Without dead ends: 20358 [2019-11-25 08:55:34,729 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:55:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20358 states. [2019-11-25 08:55:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20358 to 20358. [2019-11-25 08:55:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20358 states. [2019-11-25 08:55:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20358 states to 20358 states and 78423 transitions. [2019-11-25 08:55:35,751 INFO L78 Accepts]: Start accepts. Automaton has 20358 states and 78423 transitions. Word has length 37 [2019-11-25 08:55:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:35,752 INFO L462 AbstractCegarLoop]: Abstraction has 20358 states and 78423 transitions. [2019-11-25 08:55:35,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 20358 states and 78423 transitions. [2019-11-25 08:55:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:55:35,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:35,764 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] [2019-11-25 08:55:35,765 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:55:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash 530677364, now seen corresponding path program 1 times [2019-11-25 08:55:35,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:35,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333742626] [2019-11-25 08:55:35,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:35,933 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:55:35,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333742626] [2019-11-25 08:55:35,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:35,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:35,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600195725] [2019-11-25 08:55:35,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:35,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:35,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:35,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:35,936 INFO L87 Difference]: Start difference. First operand 20358 states and 78423 transitions. Second operand 5 states. [2019-11-25 08:55:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:37,094 INFO L93 Difference]: Finished difference Result 31836 states and 116040 transitions. [2019-11-25 08:55:37,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:37,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-25 08:55:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:37,219 INFO L225 Difference]: With dead ends: 31836 [2019-11-25 08:55:37,219 INFO L226 Difference]: Without dead ends: 31284 [2019-11-25 08:55:37,220 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:55:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31284 states. [2019-11-25 08:55:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31284 to 29703. [2019-11-25 08:55:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29703 states. [2019-11-25 08:55:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29703 states to 29703 states and 109517 transitions. [2019-11-25 08:55:38,095 INFO L78 Accepts]: Start accepts. Automaton has 29703 states and 109517 transitions. Word has length 45 [2019-11-25 08:55:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:38,096 INFO L462 AbstractCegarLoop]: Abstraction has 29703 states and 109517 transitions. [2019-11-25 08:55:38,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 29703 states and 109517 transitions. [2019-11-25 08:55:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 08:55:38,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:38,101 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] [2019-11-25 08:55:38,101 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:55:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:38,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1355560122, now seen corresponding path program 1 times [2019-11-25 08:55:38,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:38,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360705865] [2019-11-25 08:55:38,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:38,170 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:55:38,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360705865] [2019-11-25 08:55:38,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:38,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:38,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344215526] [2019-11-25 08:55:38,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:38,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:38,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:38,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:38,172 INFO L87 Difference]: Start difference. First operand 29703 states and 109517 transitions. Second operand 5 states. [2019-11-25 08:55:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:38,984 INFO L93 Difference]: Finished difference Result 38694 states and 139689 transitions. [2019-11-25 08:55:38,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:38,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-25 08:55:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:39,231 INFO L225 Difference]: With dead ends: 38694 [2019-11-25 08:55:39,231 INFO L226 Difference]: Without dead ends: 38246 [2019-11-25 08:55:39,232 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:55:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38246 states. [2019-11-25 08:55:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38246 to 32949. [2019-11-25 08:55:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32949 states. [2019-11-25 08:55:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32949 states to 32949 states and 120526 transitions. [2019-11-25 08:55:40,167 INFO L78 Accepts]: Start accepts. Automaton has 32949 states and 120526 transitions. Word has length 46 [2019-11-25 08:55:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:40,168 INFO L462 AbstractCegarLoop]: Abstraction has 32949 states and 120526 transitions. [2019-11-25 08:55:40,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 32949 states and 120526 transitions. [2019-11-25 08:55:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-25 08:55:40,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:40,179 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:55:40,179 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:55:40,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash -560493652, now seen corresponding path program 1 times [2019-11-25 08:55:40,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:40,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583600958] [2019-11-25 08:55:40,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:40,250 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:55:40,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583600958] [2019-11-25 08:55:40,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:40,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:40,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577342204] [2019-11-25 08:55:40,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:40,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:40,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:40,255 INFO L87 Difference]: Start difference. First operand 32949 states and 120526 transitions. Second operand 3 states. [2019-11-25 08:55:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:40,487 INFO L93 Difference]: Finished difference Result 42410 states and 152017 transitions. [2019-11-25 08:55:40,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:40,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-25 08:55:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:41,168 INFO L225 Difference]: With dead ends: 42410 [2019-11-25 08:55:41,169 INFO L226 Difference]: Without dead ends: 42410 [2019-11-25 08:55:41,171 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:55:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42410 states. [2019-11-25 08:55:41,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42410 to 37663. [2019-11-25 08:55:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37663 states. [2019-11-25 08:55:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37663 states to 37663 states and 136330 transitions. [2019-11-25 08:55:41,961 INFO L78 Accepts]: Start accepts. Automaton has 37663 states and 136330 transitions. Word has length 48 [2019-11-25 08:55:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:41,961 INFO L462 AbstractCegarLoop]: Abstraction has 37663 states and 136330 transitions. [2019-11-25 08:55:41,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37663 states and 136330 transitions. [2019-11-25 08:55:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:55:41,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:41,977 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] [2019-11-25 08:55:41,977 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:55:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -43798609, now seen corresponding path program 1 times [2019-11-25 08:55:41,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:41,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434922223] [2019-11-25 08:55:41,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:42,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:55:42,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434922223] [2019-11-25 08:55:42,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:42,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:42,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176868405] [2019-11-25 08:55:42,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:42,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:42,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:42,084 INFO L87 Difference]: Start difference. First operand 37663 states and 136330 transitions. Second operand 6 states. [2019-11-25 08:55:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:42,769 INFO L93 Difference]: Finished difference Result 48754 states and 172979 transitions. [2019-11-25 08:55:42,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:55:42,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-25 08:55:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:43,382 INFO L225 Difference]: With dead ends: 48754 [2019-11-25 08:55:43,383 INFO L226 Difference]: Without dead ends: 48234 [2019-11-25 08:55:43,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48234 states. [2019-11-25 08:55:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48234 to 38227. [2019-11-25 08:55:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38227 states. [2019-11-25 08:55:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38227 states to 38227 states and 138493 transitions. [2019-11-25 08:55:44,118 INFO L78 Accepts]: Start accepts. Automaton has 38227 states and 138493 transitions. Word has length 52 [2019-11-25 08:55:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:44,119 INFO L462 AbstractCegarLoop]: Abstraction has 38227 states and 138493 transitions. [2019-11-25 08:55:44,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 38227 states and 138493 transitions. [2019-11-25 08:55:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:55:44,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:44,146 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] [2019-11-25 08:55:44,146 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:55:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash 863719927, now seen corresponding path program 1 times [2019-11-25 08:55:44,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:44,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163118406] [2019-11-25 08:55:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:44,248 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:55:44,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163118406] [2019-11-25 08:55:44,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:44,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:44,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239770032] [2019-11-25 08:55:44,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:44,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:44,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:44,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:44,250 INFO L87 Difference]: Start difference. First operand 38227 states and 138493 transitions. Second operand 6 states. [2019-11-25 08:55:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:44,968 INFO L93 Difference]: Finished difference Result 53003 states and 189569 transitions. [2019-11-25 08:55:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:44,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-25 08:55:44,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:45,101 INFO L225 Difference]: With dead ends: 53003 [2019-11-25 08:55:45,101 INFO L226 Difference]: Without dead ends: 52027 [2019-11-25 08:55:45,101 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:55:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2019-11-25 08:55:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 48780. [2019-11-25 08:55:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48780 states. [2019-11-25 08:55:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48780 states to 48780 states and 175224 transitions. [2019-11-25 08:55:46,638 INFO L78 Accepts]: Start accepts. Automaton has 48780 states and 175224 transitions. Word has length 52 [2019-11-25 08:55:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:46,639 INFO L462 AbstractCegarLoop]: Abstraction has 48780 states and 175224 transitions. [2019-11-25 08:55:46,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 48780 states and 175224 transitions. [2019-11-25 08:55:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:55:46,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:46,658 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] [2019-11-25 08:55:46,658 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:55:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -933231432, now seen corresponding path program 1 times [2019-11-25 08:55:46,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:46,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024937477] [2019-11-25 08:55:46,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:46,763 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:55:46,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024937477] [2019-11-25 08:55:46,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:46,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:46,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479900951] [2019-11-25 08:55:46,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:46,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:46,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:46,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:46,764 INFO L87 Difference]: Start difference. First operand 48780 states and 175224 transitions. Second operand 7 states. [2019-11-25 08:55:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:47,861 INFO L93 Difference]: Finished difference Result 70895 states and 244521 transitions. [2019-11-25 08:55:47,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:55:47,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-25 08:55:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:47,998 INFO L225 Difference]: With dead ends: 70895 [2019-11-25 08:55:47,998 INFO L226 Difference]: Without dead ends: 70895 [2019-11-25 08:55:47,998 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:55:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70895 states. [2019-11-25 08:55:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70895 to 57888. [2019-11-25 08:55:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57888 states. [2019-11-25 08:55:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57888 states to 57888 states and 203148 transitions. [2019-11-25 08:55:49,075 INFO L78 Accepts]: Start accepts. Automaton has 57888 states and 203148 transitions. Word has length 52 [2019-11-25 08:55:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:49,076 INFO L462 AbstractCegarLoop]: Abstraction has 57888 states and 203148 transitions. [2019-11-25 08:55:49,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57888 states and 203148 transitions. [2019-11-25 08:55:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-25 08:55:49,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:49,089 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] [2019-11-25 08:55:49,089 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:55:49,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -45727751, now seen corresponding path program 1 times [2019-11-25 08:55:49,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:49,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791828441] [2019-11-25 08:55:49,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:49,174 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:55:49,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791828441] [2019-11-25 08:55:49,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:49,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:49,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455923329] [2019-11-25 08:55:49,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:49,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:49,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:49,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:49,176 INFO L87 Difference]: Start difference. First operand 57888 states and 203148 transitions. Second operand 4 states. [2019-11-25 08:55:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:49,234 INFO L93 Difference]: Finished difference Result 10858 states and 33393 transitions. [2019-11-25 08:55:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:49,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-25 08:55:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:49,245 INFO L225 Difference]: With dead ends: 10858 [2019-11-25 08:55:49,245 INFO L226 Difference]: Without dead ends: 9359 [2019-11-25 08:55:49,246 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:55:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2019-11-25 08:55:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9311. [2019-11-25 08:55:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9311 states. [2019-11-25 08:55:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9311 states to 9311 states and 28343 transitions. [2019-11-25 08:55:49,707 INFO L78 Accepts]: Start accepts. Automaton has 9311 states and 28343 transitions. Word has length 52 [2019-11-25 08:55:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:49,707 INFO L462 AbstractCegarLoop]: Abstraction has 9311 states and 28343 transitions. [2019-11-25 08:55:49,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9311 states and 28343 transitions. [2019-11-25 08:55:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:55:49,711 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:49,711 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] [2019-11-25 08:55:49,711 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:55:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1156284571, now seen corresponding path program 1 times [2019-11-25 08:55:49,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:49,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107926718] [2019-11-25 08:55:49,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:49,780 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:55:49,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107926718] [2019-11-25 08:55:49,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:49,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:49,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080175989] [2019-11-25 08:55:49,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:49,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:49,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:49,782 INFO L87 Difference]: Start difference. First operand 9311 states and 28343 transitions. Second operand 4 states. [2019-11-25 08:55:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:49,953 INFO L93 Difference]: Finished difference Result 10886 states and 33035 transitions. [2019-11-25 08:55:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:49,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-25 08:55:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:49,970 INFO L225 Difference]: With dead ends: 10886 [2019-11-25 08:55:49,971 INFO L226 Difference]: Without dead ends: 10886 [2019-11-25 08:55:49,971 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:55:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2019-11-25 08:55:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 9878. [2019-11-25 08:55:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9878 states. [2019-11-25 08:55:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9878 states to 9878 states and 30014 transitions. [2019-11-25 08:55:50,135 INFO L78 Accepts]: Start accepts. Automaton has 9878 states and 30014 transitions. Word has length 62 [2019-11-25 08:55:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:50,136 INFO L462 AbstractCegarLoop]: Abstraction has 9878 states and 30014 transitions. [2019-11-25 08:55:50,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 9878 states and 30014 transitions. [2019-11-25 08:55:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:55:50,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:50,142 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] [2019-11-25 08:55:50,143 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:55:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 586525764, now seen corresponding path program 1 times [2019-11-25 08:55:50,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:50,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861354729] [2019-11-25 08:55:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:50,257 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:55:50,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861354729] [2019-11-25 08:55:50,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:50,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:50,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746352095] [2019-11-25 08:55:50,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:50,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:50,259 INFO L87 Difference]: Start difference. First operand 9878 states and 30014 transitions. Second operand 6 states. [2019-11-25 08:55:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:50,759 INFO L93 Difference]: Finished difference Result 12784 states and 38224 transitions. [2019-11-25 08:55:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:55:50,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-11-25 08:55:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:50,776 INFO L225 Difference]: With dead ends: 12784 [2019-11-25 08:55:50,776 INFO L226 Difference]: Without dead ends: 12736 [2019-11-25 08:55:50,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12736 states. [2019-11-25 08:55:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12736 to 10617. [2019-11-25 08:55:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-11-25 08:55:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 32067 transitions. [2019-11-25 08:55:50,908 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 32067 transitions. Word has length 62 [2019-11-25 08:55:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:50,909 INFO L462 AbstractCegarLoop]: Abstraction has 10617 states and 32067 transitions. [2019-11-25 08:55:50,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 32067 transitions. [2019-11-25 08:55:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:55:50,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:50,915 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] [2019-11-25 08:55:50,915 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:55:50,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:50,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1604978825, now seen corresponding path program 1 times [2019-11-25 08:55:50,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:50,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881885438] [2019-11-25 08:55:50,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:50,974 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:55:50,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881885438] [2019-11-25 08:55:50,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:50,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:50,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701453091] [2019-11-25 08:55:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:50,976 INFO L87 Difference]: Start difference. First operand 10617 states and 32067 transitions. Second operand 4 states. [2019-11-25 08:55:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:51,195 INFO L93 Difference]: Finished difference Result 13319 states and 39669 transitions. [2019-11-25 08:55:51,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:55:51,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-25 08:55:51,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:51,212 INFO L225 Difference]: With dead ends: 13319 [2019-11-25 08:55:51,213 INFO L226 Difference]: Without dead ends: 13319 [2019-11-25 08:55:51,213 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:55:51,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13319 states. [2019-11-25 08:55:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13319 to 12173. [2019-11-25 08:55:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12173 states. [2019-11-25 08:55:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12173 states to 12173 states and 36358 transitions. [2019-11-25 08:55:51,368 INFO L78 Accepts]: Start accepts. Automaton has 12173 states and 36358 transitions. Word has length 64 [2019-11-25 08:55:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:51,368 INFO L462 AbstractCegarLoop]: Abstraction has 12173 states and 36358 transitions. [2019-11-25 08:55:51,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 12173 states and 36358 transitions. [2019-11-25 08:55:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-25 08:55:51,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:51,377 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] [2019-11-25 08:55:51,378 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:55:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash -472230518, now seen corresponding path program 1 times [2019-11-25 08:55:51,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:51,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159546061] [2019-11-25 08:55:51,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:51,428 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:55:51,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159546061] [2019-11-25 08:55:51,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:51,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:55:51,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90991129] [2019-11-25 08:55:51,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:55:51,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:55:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:55:51,430 INFO L87 Difference]: Start difference. First operand 12173 states and 36358 transitions. Second operand 3 states. [2019-11-25 08:55:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:51,628 INFO L93 Difference]: Finished difference Result 12699 states and 37763 transitions. [2019-11-25 08:55:51,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:55:51,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-25 08:55:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:51,649 INFO L225 Difference]: With dead ends: 12699 [2019-11-25 08:55:51,649 INFO L226 Difference]: Without dead ends: 12699 [2019-11-25 08:55:51,650 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:55:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12699 states. [2019-11-25 08:55:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12699 to 12461. [2019-11-25 08:55:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12461 states. [2019-11-25 08:55:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12461 states to 12461 states and 37122 transitions. [2019-11-25 08:55:51,807 INFO L78 Accepts]: Start accepts. Automaton has 12461 states and 37122 transitions. Word has length 64 [2019-11-25 08:55:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:51,807 INFO L462 AbstractCegarLoop]: Abstraction has 12461 states and 37122 transitions. [2019-11-25 08:55:51,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:55:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12461 states and 37122 transitions. [2019-11-25 08:55:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:51,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:51,817 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] [2019-11-25 08:55:51,817 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:55:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1050150005, now seen corresponding path program 1 times [2019-11-25 08:55:51,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:51,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725128625] [2019-11-25 08:55:51,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:51,923 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:55:51,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725128625] [2019-11-25 08:55:51,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:51,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:51,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134941109] [2019-11-25 08:55:51,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:51,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:51,925 INFO L87 Difference]: Start difference. First operand 12461 states and 37122 transitions. Second operand 6 states. [2019-11-25 08:55:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:52,389 INFO L93 Difference]: Finished difference Result 13732 states and 40361 transitions. [2019-11-25 08:55:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:52,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-25 08:55:52,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:52,405 INFO L225 Difference]: With dead ends: 13732 [2019-11-25 08:55:52,405 INFO L226 Difference]: Without dead ends: 13732 [2019-11-25 08:55:52,406 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:55:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2019-11-25 08:55:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 13246. [2019-11-25 08:55:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-11-25 08:55:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 39077 transitions. [2019-11-25 08:55:52,564 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 39077 transitions. Word has length 66 [2019-11-25 08:55:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:52,564 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 39077 transitions. [2019-11-25 08:55:52,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 39077 transitions. [2019-11-25 08:55:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:52,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:52,578 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] [2019-11-25 08:55:52,579 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:55:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1027059338, now seen corresponding path program 1 times [2019-11-25 08:55:52,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:52,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886830701] [2019-11-25 08:55:52,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,679 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:55:52,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886830701] [2019-11-25 08:55:52,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:52,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:52,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981679916] [2019-11-25 08:55:52,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:52,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:52,682 INFO L87 Difference]: Start difference. First operand 13246 states and 39077 transitions. Second operand 6 states. [2019-11-25 08:55:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:53,048 INFO L93 Difference]: Finished difference Result 15569 states and 44587 transitions. [2019-11-25 08:55:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:53,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-25 08:55:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:53,066 INFO L225 Difference]: With dead ends: 15569 [2019-11-25 08:55:53,066 INFO L226 Difference]: Without dead ends: 15569 [2019-11-25 08:55:53,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:55:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-11-25 08:55:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 13820. [2019-11-25 08:55:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13820 states. [2019-11-25 08:55:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13820 states to 13820 states and 39927 transitions. [2019-11-25 08:55:53,232 INFO L78 Accepts]: Start accepts. Automaton has 13820 states and 39927 transitions. Word has length 66 [2019-11-25 08:55:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:53,233 INFO L462 AbstractCegarLoop]: Abstraction has 13820 states and 39927 transitions. [2019-11-25 08:55:53,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 13820 states and 39927 transitions. [2019-11-25 08:55:53,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:53,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:53,243 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] [2019-11-25 08:55:53,244 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:55:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -815708425, now seen corresponding path program 1 times [2019-11-25 08:55:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341692301] [2019-11-25 08:55:53,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,322 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:55:53,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341692301] [2019-11-25 08:55:53,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:53,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:53,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332677980] [2019-11-25 08:55:53,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:53,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:53,324 INFO L87 Difference]: Start difference. First operand 13820 states and 39927 transitions. Second operand 5 states. [2019-11-25 08:55:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:53,578 INFO L93 Difference]: Finished difference Result 17381 states and 50006 transitions. [2019-11-25 08:55:53,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:53,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:55:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:53,598 INFO L225 Difference]: With dead ends: 17381 [2019-11-25 08:55:53,598 INFO L226 Difference]: Without dead ends: 17381 [2019-11-25 08:55:53,598 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:55:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17381 states. [2019-11-25 08:55:53,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17381 to 14858. [2019-11-25 08:55:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14858 states. [2019-11-25 08:55:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14858 states to 14858 states and 42559 transitions. [2019-11-25 08:55:53,773 INFO L78 Accepts]: Start accepts. Automaton has 14858 states and 42559 transitions. Word has length 66 [2019-11-25 08:55:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:53,773 INFO L462 AbstractCegarLoop]: Abstraction has 14858 states and 42559 transitions. [2019-11-25 08:55:53,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14858 states and 42559 transitions. [2019-11-25 08:55:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:53,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:53,781 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] [2019-11-25 08:55:53,781 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:55:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1326242602, now seen corresponding path program 1 times [2019-11-25 08:55:53,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368835218] [2019-11-25 08:55:53,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,851 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:55:53,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368835218] [2019-11-25 08:55:53,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:53,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:53,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568285886] [2019-11-25 08:55:53,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:53,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:53,853 INFO L87 Difference]: Start difference. First operand 14858 states and 42559 transitions. Second operand 5 states. [2019-11-25 08:55:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:54,216 INFO L93 Difference]: Finished difference Result 19763 states and 56506 transitions. [2019-11-25 08:55:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:54,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:55:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:54,237 INFO L225 Difference]: With dead ends: 19763 [2019-11-25 08:55:54,238 INFO L226 Difference]: Without dead ends: 19763 [2019-11-25 08:55:54,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2019-11-25 08:55:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 15763. [2019-11-25 08:55:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15763 states. [2019-11-25 08:55:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15763 states to 15763 states and 45145 transitions. [2019-11-25 08:55:54,450 INFO L78 Accepts]: Start accepts. Automaton has 15763 states and 45145 transitions. Word has length 66 [2019-11-25 08:55:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:54,450 INFO L462 AbstractCegarLoop]: Abstraction has 15763 states and 45145 transitions. [2019-11-25 08:55:54,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 15763 states and 45145 transitions. [2019-11-25 08:55:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:54,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:54,460 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] [2019-11-25 08:55:54,460 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:55:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:54,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1161270231, now seen corresponding path program 1 times [2019-11-25 08:55:54,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:54,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549692252] [2019-11-25 08:55:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,518 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:55:54,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549692252] [2019-11-25 08:55:54,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:54,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:55:54,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056429196] [2019-11-25 08:55:54,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:55:54,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:55:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:55:54,520 INFO L87 Difference]: Start difference. First operand 15763 states and 45145 transitions. Second operand 4 states. [2019-11-25 08:55:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:55,048 INFO L93 Difference]: Finished difference Result 20659 states and 59353 transitions. [2019-11-25 08:55:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:55,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-25 08:55:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:55,068 INFO L225 Difference]: With dead ends: 20659 [2019-11-25 08:55:55,068 INFO L226 Difference]: Without dead ends: 20383 [2019-11-25 08:55:55,069 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:55:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20383 states. [2019-11-25 08:55:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20383 to 18946. [2019-11-25 08:55:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18946 states. [2019-11-25 08:55:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18946 states to 18946 states and 54434 transitions. [2019-11-25 08:55:55,281 INFO L78 Accepts]: Start accepts. Automaton has 18946 states and 54434 transitions. Word has length 66 [2019-11-25 08:55:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:55,282 INFO L462 AbstractCegarLoop]: Abstraction has 18946 states and 54434 transitions. [2019-11-25 08:55:55,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:55:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 18946 states and 54434 transitions. [2019-11-25 08:55:55,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:55,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:55,291 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] [2019-11-25 08:55:55,291 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:55:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -635681128, now seen corresponding path program 1 times [2019-11-25 08:55:55,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:55,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170470318] [2019-11-25 08:55:55,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,423 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:55:55,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170470318] [2019-11-25 08:55:55,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:55,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:55,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055228988] [2019-11-25 08:55:55,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:55,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:55,425 INFO L87 Difference]: Start difference. First operand 18946 states and 54434 transitions. Second operand 7 states. [2019-11-25 08:55:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:55,808 INFO L93 Difference]: Finished difference Result 17840 states and 48888 transitions. [2019-11-25 08:55:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:55:55,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-25 08:55:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:55,827 INFO L225 Difference]: With dead ends: 17840 [2019-11-25 08:55:55,827 INFO L226 Difference]: Without dead ends: 17840 [2019-11-25 08:55:55,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17840 states. [2019-11-25 08:55:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17840 to 12474. [2019-11-25 08:55:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12474 states. [2019-11-25 08:55:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12474 states to 12474 states and 34351 transitions. [2019-11-25 08:55:55,987 INFO L78 Accepts]: Start accepts. Automaton has 12474 states and 34351 transitions. Word has length 66 [2019-11-25 08:55:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:55,988 INFO L462 AbstractCegarLoop]: Abstraction has 12474 states and 34351 transitions. [2019-11-25 08:55:55,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12474 states and 34351 transitions. [2019-11-25 08:55:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:55:55,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:55,993 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] [2019-11-25 08:55:55,994 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:55:55,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:55,994 INFO L82 PathProgramCache]: Analyzing trace with hash 251822553, now seen corresponding path program 1 times [2019-11-25 08:55:55,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:55,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786449830] [2019-11-25 08:55:55,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,069 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:55:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786449830] [2019-11-25 08:55:56,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:56,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:56,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857688742] [2019-11-25 08:55:56,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:56,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:56,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:56,077 INFO L87 Difference]: Start difference. First operand 12474 states and 34351 transitions. Second operand 5 states. [2019-11-25 08:55:56,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:56,129 INFO L93 Difference]: Finished difference Result 4023 states and 9370 transitions. [2019-11-25 08:55:56,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:55:56,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-25 08:55:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:56,133 INFO L225 Difference]: With dead ends: 4023 [2019-11-25 08:55:56,133 INFO L226 Difference]: Without dead ends: 3350 [2019-11-25 08:55:56,134 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:55:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2019-11-25 08:55:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3090. [2019-11-25 08:55:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3090 states. [2019-11-25 08:55:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 7076 transitions. [2019-11-25 08:55:56,171 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 7076 transitions. Word has length 66 [2019-11-25 08:55:56,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:56,171 INFO L462 AbstractCegarLoop]: Abstraction has 3090 states and 7076 transitions. [2019-11-25 08:55:56,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 7076 transitions. [2019-11-25 08:55:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:56,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:56,175 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] [2019-11-25 08:55:56,175 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:55:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash -68109150, now seen corresponding path program 1 times [2019-11-25 08:55:56,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970299163] [2019-11-25 08:55:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,260 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:55:56,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970299163] [2019-11-25 08:55:56,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:56,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:56,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488162251] [2019-11-25 08:55:56,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:56,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:56,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:56,262 INFO L87 Difference]: Start difference. First operand 3090 states and 7076 transitions. Second operand 5 states. [2019-11-25 08:55:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:56,482 INFO L93 Difference]: Finished difference Result 3586 states and 8096 transitions. [2019-11-25 08:55:56,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:56,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-25 08:55:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:56,485 INFO L225 Difference]: With dead ends: 3586 [2019-11-25 08:55:56,485 INFO L226 Difference]: Without dead ends: 3564 [2019-11-25 08:55:56,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 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:55:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-11-25 08:55:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3183. [2019-11-25 08:55:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3183 states. [2019-11-25 08:55:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 7262 transitions. [2019-11-25 08:55:56,511 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 7262 transitions. Word has length 83 [2019-11-25 08:55:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:56,511 INFO L462 AbstractCegarLoop]: Abstraction has 3183 states and 7262 transitions. [2019-11-25 08:55:56,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 7262 transitions. [2019-11-25 08:55:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:56,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:56,514 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:55:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash -291825888, now seen corresponding path program 1 times [2019-11-25 08:55:56,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590361128] [2019-11-25 08:55:56,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,593 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:55:56,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590361128] [2019-11-25 08:55:56,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:56,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:55:56,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122388303] [2019-11-25 08:55:56,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:55:56,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:55:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:56,595 INFO L87 Difference]: Start difference. First operand 3183 states and 7262 transitions. Second operand 6 states. [2019-11-25 08:55:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:56,809 INFO L93 Difference]: Finished difference Result 3165 states and 7192 transitions. [2019-11-25 08:55:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:56,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-25 08:55:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:56,813 INFO L225 Difference]: With dead ends: 3165 [2019-11-25 08:55:56,813 INFO L226 Difference]: Without dead ends: 3165 [2019-11-25 08:55:56,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2019-11-25 08:55:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3089. [2019-11-25 08:55:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-25 08:55:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7030 transitions. [2019-11-25 08:55:56,849 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7030 transitions. Word has length 83 [2019-11-25 08:55:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:56,849 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7030 transitions. [2019-11-25 08:55:56,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:55:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7030 transitions. [2019-11-25 08:55:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:56,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:56,854 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] [2019-11-25 08:55:56,855 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:55:56,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1496830279, now seen corresponding path program 1 times [2019-11-25 08:55:56,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311340129] [2019-11-25 08:55:56,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,005 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:55:57,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311340129] [2019-11-25 08:55:57,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:55:57,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394251175] [2019-11-25 08:55:57,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:55:57,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:55:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:55:57,007 INFO L87 Difference]: Start difference. First operand 3089 states and 7030 transitions. Second operand 5 states. [2019-11-25 08:55:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,050 INFO L93 Difference]: Finished difference Result 3089 states and 7021 transitions. [2019-11-25 08:55:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:57,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-25 08:55:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:57,053 INFO L225 Difference]: With dead ends: 3089 [2019-11-25 08:55:57,053 INFO L226 Difference]: Without dead ends: 3089 [2019-11-25 08:55:57,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:55:57,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-11-25 08:55:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2797. [2019-11-25 08:55:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-11-25 08:55:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 6391 transitions. [2019-11-25 08:55:57,088 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 6391 transitions. Word has length 83 [2019-11-25 08:55:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:57,088 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 6391 transitions. [2019-11-25 08:55:57,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:55:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 6391 transitions. [2019-11-25 08:55:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:57,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:57,092 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] [2019-11-25 08:55:57,092 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:55:57,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1910633336, now seen corresponding path program 1 times [2019-11-25 08:55:57,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267642947] [2019-11-25 08:55:57,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,204 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:55:57,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267642947] [2019-11-25 08:55:57,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:57,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218824645] [2019-11-25 08:55:57,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:57,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:57,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:57,206 INFO L87 Difference]: Start difference. First operand 2797 states and 6391 transitions. Second operand 7 states. [2019-11-25 08:55:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,267 INFO L93 Difference]: Finished difference Result 4757 states and 10954 transitions. [2019-11-25 08:55:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:55:57,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-11-25 08:55:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:57,269 INFO L225 Difference]: With dead ends: 4757 [2019-11-25 08:55:57,269 INFO L226 Difference]: Without dead ends: 2047 [2019-11-25 08:55:57,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2019-11-25 08:55:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 2047. [2019-11-25 08:55:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-11-25 08:55:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 4707 transitions. [2019-11-25 08:55:57,284 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 4707 transitions. Word has length 83 [2019-11-25 08:55:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:57,284 INFO L462 AbstractCegarLoop]: Abstraction has 2047 states and 4707 transitions. [2019-11-25 08:55:57,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 4707 transitions. [2019-11-25 08:55:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:57,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:57,286 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] [2019-11-25 08:55:57,286 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:55:57,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1495631300, now seen corresponding path program 2 times [2019-11-25 08:55:57,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940676041] [2019-11-25 08:55:57,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:55:57,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940676041] [2019-11-25 08:55:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:55:57,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325434780] [2019-11-25 08:55:57,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:55:57,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:55:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:55:57,405 INFO L87 Difference]: Start difference. First operand 2047 states and 4707 transitions. Second operand 10 states. [2019-11-25 08:55:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:57,739 INFO L93 Difference]: Finished difference Result 4508 states and 10253 transitions. [2019-11-25 08:55:57,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 08:55:57,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-11-25 08:55:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:57,741 INFO L225 Difference]: With dead ends: 4508 [2019-11-25 08:55:57,741 INFO L226 Difference]: Without dead ends: 2967 [2019-11-25 08:55:57,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-11-25 08:55:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2019-11-25 08:55:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2116. [2019-11-25 08:55:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-25 08:55:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 4810 transitions. [2019-11-25 08:55:57,761 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 4810 transitions. Word has length 83 [2019-11-25 08:55:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:57,761 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 4810 transitions. [2019-11-25 08:55:57,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:55:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 4810 transitions. [2019-11-25 08:55:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:55:57,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:57,763 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] [2019-11-25 08:55:57,763 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:55:57,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 930632538, now seen corresponding path program 3 times [2019-11-25 08:55:57,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235204707] [2019-11-25 08:55:57,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:55:57,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:55:57,845 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:55:58,013 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:55:58,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:55:58 BasicIcfg [2019-11-25 08:55:58,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:55:58,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:55:58,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:55:58,016 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:55:58,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:31" (3/4) ... [2019-11-25 08:55:58,019 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:55:58,167 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bb3edb94-ab26-4f67-bfc9-34b6634c1da1/bin/uautomizer/witness.graphml [2019-11-25 08:55:58,168 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:55:58,170 INFO L168 Benchmark]: Toolchain (without parser) took 28014.40 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 939.3 MB in the beginning and 1.7 GB in the end (delta: -712.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,170 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:55:58,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.22 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:55:58,171 INFO L168 Benchmark]: Boogie Preprocessor took 43.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,172 INFO L168 Benchmark]: RCFGBuilder took 622.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,172 INFO L168 Benchmark]: TraceAbstraction took 26474.79 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -672.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,172 INFO L168 Benchmark]: Witness Printer took 152.31 ms. Allocated memory is still 3.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:55:58,174 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 653.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.22 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. * Boogie Preprocessor took 43.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 622.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26474.79 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -672.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 152.31 ms. Allocated memory is still 3.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2565; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2565, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2566; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2566, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 326 locations, 5 error locations. Result: UNSAFE, OverallTime: 26.2s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6326 SDtfs, 7291 SDslu, 13579 SDs, 0 SdLazy, 4749 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 60 SyntacticMatches, 14 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57888occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 59866 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1596 NumberOfCodeBlocks, 1596 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1489 ConstructedInterpolants, 0 QuantifiedInterpolants, 238982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...