./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/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 5d2cd970f76a76b84bde79762c11ce7e22c69784 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:48:42,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:48:42,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:48:43,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:48:43,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:48:43,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:48:43,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:48:43,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:48:43,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:48:43,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:48:43,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:48:43,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:48:43,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:48:43,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:48:43,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:48:43,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:48:43,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:48:43,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:48:43,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:48:43,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:48:43,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:48:43,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:48:43,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:48:43,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:48:43,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:48:43,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:48:43,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:48:43,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:48:43,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:48:43,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:48:43,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:48:43,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:48:43,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:48:43,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:48:43,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:48:43,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:48:43,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:48:43,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:48:43,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:48:43,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:48:43,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:48:43,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:48:43,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:48:43,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:48:43,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:48:43,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:48:43,092 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:48:43,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:48:43,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:48:43,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:48:43,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:48:43,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:48:43,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:48:43,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:48:43,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:48:43,095 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:48:43,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:48:43,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:48:43,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:48:43,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:48:43,096 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:48:43,096 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:48:43,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:48:43,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:48:43,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:48:43,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:48:43,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:48:43,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:48:43,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:48:43,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:48:43,099 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_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/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 -> 5d2cd970f76a76b84bde79762c11ce7e22c69784 [2019-11-25 08:48:43,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:48:43,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:48:43,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:48:43,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:48:43,244 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:48:43,245 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-25 08:48:43,294 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/data/1391c8eec/ebcd41681a03415f9cff4035abc48a0b/FLAGa1d122507 [2019-11-25 08:48:43,817 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:48:43,825 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-11-25 08:48:43,839 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/data/1391c8eec/ebcd41681a03415f9cff4035abc48a0b/FLAGa1d122507 [2019-11-25 08:48:44,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/data/1391c8eec/ebcd41681a03415f9cff4035abc48a0b [2019-11-25 08:48:44,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:48:44,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:48:44,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:44,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:48:44,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:48:44,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:44,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599dd39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44, skipping insertion in model container [2019-11-25 08:48:44,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:44,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:48:44,376 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:48:44,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:44,793 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:48:44,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:48:44,970 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:48:44,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44 WrapperNode [2019-11-25 08:48:44,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:48:44,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:44,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:48:44,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:48:44,979 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:48:44" (1/1) ... [2019-11-25 08:48:44,996 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:48:44" (1/1) ... [2019-11-25 08:48:45,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:48:45,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:48:45,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:48:45,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:48:45,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... [2019-11-25 08:48:45,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:48:45,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:48:45,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:48:45,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:48:45,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/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:48:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:48:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-25 08:48:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:48:45,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:48:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-25 08:48:45,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-25 08:48:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-25 08:48:45,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-25 08:48:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-25 08:48:45,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:48:45,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:48:45,133 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:48:45,686 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:48:45,686 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-25 08:48:45,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:45 BoogieIcfgContainer [2019-11-25 08:48:45,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:48:45,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:48:45,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:48:45,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:48:45,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:48:44" (1/3) ... [2019-11-25 08:48:45,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6fb56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:45, skipping insertion in model container [2019-11-25 08:48:45,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:48:44" (2/3) ... [2019-11-25 08:48:45,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6fb56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:48:45, skipping insertion in model container [2019-11-25 08:48:45,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:45" (3/3) ... [2019-11-25 08:48:45,704 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-11-25 08:48:45,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,782 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,807 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,845 WARN L315 ript$VariableManager]: TermVariabe P0Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe P1Thread2of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,878 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,883 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,884 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread3of3ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-25 08:48:45,913 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-25 08:48:45,913 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:48:45,920 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-25 08:48:45,931 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-25 08:48:45,949 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:48:45,949 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:48:45,949 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:48:45,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:48:45,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:48:45,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:48:45,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:48:45,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:48:45,977 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 277 places, 353 transitions [2019-11-25 08:48:47,629 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-11-25 08:48:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-11-25 08:48:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-25 08:48:47,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:47,640 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] [2019-11-25 08:48:47,641 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:48:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash -870107987, now seen corresponding path program 1 times [2019-11-25 08:48:47,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:47,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886301442] [2019-11-25 08:48:47,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:47,918 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:48:47,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886301442] [2019-11-25 08:48:47,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:47,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:48:47,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713166811] [2019-11-25 08:48:47,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:48:47,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:48:47,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:48:47,940 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-11-25 08:48:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:48,502 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-11-25 08:48:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:48:48,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-25 08:48:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:48,720 INFO L225 Difference]: With dead ends: 26619 [2019-11-25 08:48:48,720 INFO L226 Difference]: Without dead ends: 20363 [2019-11-25 08:48:48,726 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:48:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-11-25 08:48:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-11-25 08:48:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-11-25 08:48:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-11-25 08:48:49,895 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-11-25 08:48:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-11-25 08:48:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:48:49,896 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-11-25 08:48:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:48:49,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:49,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:49,909 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:48:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1372959301, now seen corresponding path program 1 times [2019-11-25 08:48:49,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:49,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116207710] [2019-11-25 08:48:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:50,086 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:48:50,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116207710] [2019-11-25 08:48:50,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:50,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:50,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578255385] [2019-11-25 08:48:50,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:50,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:50,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:50,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:50,090 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-11-25 08:48:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:51,416 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-11-25 08:48:51,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:51,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-25 08:48:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:51,545 INFO L225 Difference]: With dead ends: 31841 [2019-11-25 08:48:51,545 INFO L226 Difference]: Without dead ends: 31289 [2019-11-25 08:48:51,546 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:48:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-11-25 08:48:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-11-25 08:48:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-11-25 08:48:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-11-25 08:48:52,515 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-11-25 08:48:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:52,516 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-11-25 08:48:52,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-11-25 08:48:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:48:52,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:52,524 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:48:52,524 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:48:52,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1695795612, now seen corresponding path program 1 times [2019-11-25 08:48:52,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:52,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122592015] [2019-11-25 08:48:52,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:52,619 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:48:52,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122592015] [2019-11-25 08:48:52,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:52,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:48:52,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847765573] [2019-11-25 08:48:52,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:48:52,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:48:52,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:48:52,621 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-11-25 08:48:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:53,446 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-11-25 08:48:53,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:53,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-25 08:48:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:53,597 INFO L225 Difference]: With dead ends: 38699 [2019-11-25 08:48:53,597 INFO L226 Difference]: Without dead ends: 38251 [2019-11-25 08:48:53,597 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:48:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-11-25 08:48:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-11-25 08:48:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-11-25 08:48:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-11-25 08:48:55,033 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-11-25 08:48:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:55,035 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-11-25 08:48:55,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:48:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-11-25 08:48:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 08:48:55,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:55,046 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] [2019-11-25 08:48:55,047 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:48:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1134070006, now seen corresponding path program 1 times [2019-11-25 08:48:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:55,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627294740] [2019-11-25 08:48:55,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:55,122 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:48:55,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627294740] [2019-11-25 08:48:55,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:55,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:48:55,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020750075] [2019-11-25 08:48:55,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:48:55,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:55,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:48:55,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:48:55,124 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-11-25 08:48:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:55,364 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-11-25 08:48:55,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:48:55,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-25 08:48:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:55,475 INFO L225 Difference]: With dead ends: 42415 [2019-11-25 08:48:55,475 INFO L226 Difference]: Without dead ends: 42415 [2019-11-25 08:48:55,476 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:48:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-11-25 08:48:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-11-25 08:48:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-11-25 08:48:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-11-25 08:48:56,517 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-11-25 08:48:56,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:56,517 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-11-25 08:48:56,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:48:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-11-25 08:48:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:48:56,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:56,534 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] [2019-11-25 08:48:56,535 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:48:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 125714386, now seen corresponding path program 1 times [2019-11-25 08:48:56,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:56,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903558842] [2019-11-25 08:48:56,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:56,699 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:48:56,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903558842] [2019-11-25 08:48:56,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:56,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:48:56,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739901996] [2019-11-25 08:48:56,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:48:56,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:48:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:48:56,702 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-11-25 08:48:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:48:58,151 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-11-25 08:48:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:48:58,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:48:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:48:58,281 INFO L225 Difference]: With dead ends: 51814 [2019-11-25 08:48:58,281 INFO L226 Difference]: Without dead ends: 51014 [2019-11-25 08:48:58,281 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:48:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-11-25 08:48:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-11-25 08:48:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-11-25 08:48:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-11-25 08:48:59,374 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-11-25 08:48:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:48:59,374 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-11-25 08:48:59,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:48:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-11-25 08:48:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:48:59,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:48:59,397 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] [2019-11-25 08:48:59,397 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:48:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:48:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1671236973, now seen corresponding path program 1 times [2019-11-25 08:48:59,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:48:59,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916482108] [2019-11-25 08:48:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:48:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:48:59,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:48:59,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916482108] [2019-11-25 08:48:59,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:48:59,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:48:59,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503427212] [2019-11-25 08:48:59,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:48:59,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:48:59,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:48:59,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:48:59,522 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-11-25 08:49:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:01,348 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-11-25 08:49:01,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:49:01,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-25 08:49:01,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:01,499 INFO L225 Difference]: With dead ends: 68550 [2019-11-25 08:49:01,499 INFO L226 Difference]: Without dead ends: 68550 [2019-11-25 08:49:01,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:49:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-11-25 08:49:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-11-25 08:49:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-11-25 08:49:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-11-25 08:49:02,681 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-11-25 08:49:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,682 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-11-25 08:49:02,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:49:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-11-25 08:49:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:49:02,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,699 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] [2019-11-25 08:49:02,700 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:49:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash -783733292, now seen corresponding path program 1 times [2019-11-25 08:49:02,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194435099] [2019-11-25 08:49:02,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:02,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194435099] [2019-11-25 08:49:02,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:02,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:02,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019265352] [2019-11-25 08:49:02,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:02,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:02,771 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-11-25 08:49:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:02,841 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-11-25 08:49:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:02,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-25 08:49:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:02,857 INFO L225 Difference]: With dead ends: 10469 [2019-11-25 08:49:02,857 INFO L226 Difference]: Without dead ends: 9223 [2019-11-25 08:49:02,858 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:49:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-11-25 08:49:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-11-25 08:49:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-11-25 08:49:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-11-25 08:49:02,993 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-11-25 08:49:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:02,994 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-11-25 08:49:02,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-11-25 08:49:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-25 08:49:02,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:02,996 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] [2019-11-25 08:49:02,996 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:49:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:02,997 INFO L82 PathProgramCache]: Analyzing trace with hash -800467883, now seen corresponding path program 1 times [2019-11-25 08:49:02,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:02,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678203991] [2019-11-25 08:49:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:03,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678203991] [2019-11-25 08:49:03,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:03,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:03,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738645265] [2019-11-25 08:49:03,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:03,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:03,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:03,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:03,077 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-11-25 08:49:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:03,512 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-11-25 08:49:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:49:03,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-25 08:49:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:03,531 INFO L225 Difference]: With dead ends: 11222 [2019-11-25 08:49:03,531 INFO L226 Difference]: Without dead ends: 11135 [2019-11-25 08:49:03,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:49:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-11-25 08:49:03,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-11-25 08:49:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-11-25 08:49:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-11-25 08:49:03,969 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-11-25 08:49:03,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:03,970 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-11-25 08:49:03,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-11-25 08:49:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:49:03,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:03,976 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] [2019-11-25 08:49:03,976 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:49:03,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:03,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1357400536, now seen corresponding path program 1 times [2019-11-25 08:49:03,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:03,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545547913] [2019-11-25 08:49:03,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:04,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545547913] [2019-11-25 08:49:04,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:04,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749051119] [2019-11-25 08:49:04,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:04,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:04,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:04,062 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-11-25 08:49:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:04,238 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-11-25 08:49:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:49:04,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-25 08:49:04,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:04,256 INFO L225 Difference]: With dead ends: 10891 [2019-11-25 08:49:04,257 INFO L226 Difference]: Without dead ends: 10891 [2019-11-25 08:49:04,257 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:49:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-11-25 08:49:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-11-25 08:49:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-11-25 08:49:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-11-25 08:49:04,428 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-11-25 08:49:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:04,428 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-11-25 08:49:04,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-11-25 08:49:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 08:49:04,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:04,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:04,438 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:49:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash 385409799, now seen corresponding path program 1 times [2019-11-25 08:49:04,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:04,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413809108] [2019-11-25 08:49:04,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:04,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413809108] [2019-11-25 08:49:04,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:04,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:04,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320834257] [2019-11-25 08:49:04,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:04,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:04,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:04,533 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-11-25 08:49:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,085 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-11-25 08:49:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:49:05,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-25 08:49:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,107 INFO L225 Difference]: With dead ends: 12789 [2019-11-25 08:49:05,107 INFO L226 Difference]: Without dead ends: 12741 [2019-11-25 08:49:05,107 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:49:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-11-25 08:49:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-11-25 08:49:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-11-25 08:49:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-11-25 08:49:05,270 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-11-25 08:49:05,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,270 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-11-25 08:49:05,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:05,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-11-25 08:49:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:49:05,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,277 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:49:05,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2019249902, now seen corresponding path program 1 times [2019-11-25 08:49:05,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908495463] [2019-11-25 08:49:05,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:05,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908495463] [2019-11-25 08:49:05,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:05,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859917114] [2019-11-25 08:49:05,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:49:05,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:05,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:05,335 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-11-25 08:49:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:05,616 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-11-25 08:49:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:05,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-25 08:49:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:05,638 INFO L225 Difference]: With dead ends: 13324 [2019-11-25 08:49:05,638 INFO L226 Difference]: Without dead ends: 13324 [2019-11-25 08:49:05,639 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:49:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-11-25 08:49:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-11-25 08:49:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-11-25 08:49:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-11-25 08:49:05,841 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-11-25 08:49:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:05,841 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-11-25 08:49:05,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:49:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-11-25 08:49:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-25 08:49:05,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:05,852 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:05,852 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:49:05,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:05,852 INFO L82 PathProgramCache]: Analyzing trace with hash 198508051, now seen corresponding path program 1 times [2019-11-25 08:49:05,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:05,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432331234] [2019-11-25 08:49:05,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:05,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432331234] [2019-11-25 08:49:05,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:05,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:49:05,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595560131] [2019-11-25 08:49:05,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:49:05,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:05,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:49:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:05,884 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-11-25 08:49:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,071 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-11-25 08:49:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:49:06,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-25 08:49:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,089 INFO L225 Difference]: With dead ends: 12704 [2019-11-25 08:49:06,089 INFO L226 Difference]: Without dead ends: 12704 [2019-11-25 08:49:06,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:49:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-11-25 08:49:06,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-11-25 08:49:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-11-25 08:49:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-11-25 08:49:06,255 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-11-25 08:49:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:06,255 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-11-25 08:49:06,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:49:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-11-25 08:49:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:06,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:06,266 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] [2019-11-25 08:49:06,266 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:49:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash -898304257, now seen corresponding path program 1 times [2019-11-25 08:49:06,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:06,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465970999] [2019-11-25 08:49:06,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:06,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465970999] [2019-11-25 08:49:06,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:06,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:06,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702045698] [2019-11-25 08:49:06,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:06,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:06,370 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-11-25 08:49:06,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:06,961 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-11-25 08:49:06,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:06,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:49:06,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:06,992 INFO L225 Difference]: With dead ends: 13737 [2019-11-25 08:49:06,992 INFO L226 Difference]: Without dead ends: 13737 [2019-11-25 08:49:06,993 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:49:07,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-11-25 08:49:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-11-25 08:49:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-11-25 08:49:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-11-25 08:49:07,217 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-11-25 08:49:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:07,217 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-11-25 08:49:07,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-11-25 08:49:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:07,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:07,232 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] [2019-11-25 08:49:07,232 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:49:07,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1319453696, now seen corresponding path program 1 times [2019-11-25 08:49:07,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:07,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395558376] [2019-11-25 08:49:07,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:07,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395558376] [2019-11-25 08:49:07,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:07,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:07,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898154003] [2019-11-25 08:49:07,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:07,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:07,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:07,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:07,380 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-11-25 08:49:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:07,753 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-11-25 08:49:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:49:07,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-25 08:49:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:07,771 INFO L225 Difference]: With dead ends: 15574 [2019-11-25 08:49:07,771 INFO L226 Difference]: Without dead ends: 15574 [2019-11-25 08:49:07,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:49:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-11-25 08:49:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-11-25 08:49:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-11-25 08:49:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-11-25 08:49:08,123 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-11-25 08:49:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:08,124 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-11-25 08:49:08,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-11-25 08:49:08,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:08,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:08,136 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] [2019-11-25 08:49:08,136 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:49:08,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:08,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1530804609, now seen corresponding path program 1 times [2019-11-25 08:49:08,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:08,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336070337] [2019-11-25 08:49:08,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:08,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336070337] [2019-11-25 08:49:08,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:08,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:08,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135093345] [2019-11-25 08:49:08,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:08,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:08,200 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-11-25 08:49:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:08,466 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-11-25 08:49:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:08,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:49:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:08,487 INFO L225 Difference]: With dead ends: 17386 [2019-11-25 08:49:08,487 INFO L226 Difference]: Without dead ends: 17386 [2019-11-25 08:49:08,487 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:49:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-11-25 08:49:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-11-25 08:49:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-11-25 08:49:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-11-25 08:49:08,674 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-11-25 08:49:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:08,675 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-11-25 08:49:08,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-11-25 08:49:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:08,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:08,684 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] [2019-11-25 08:49:08,684 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:49:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1020270432, now seen corresponding path program 1 times [2019-11-25 08:49:08,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:08,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836070810] [2019-11-25 08:49:08,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:08,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836070810] [2019-11-25 08:49:08,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:08,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:08,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178910148] [2019-11-25 08:49:08,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:08,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:08,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:08,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:08,743 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-11-25 08:49:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,172 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-11-25 08:49:09,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:09,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:49:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,198 INFO L225 Difference]: With dead ends: 19768 [2019-11-25 08:49:09,198 INFO L226 Difference]: Without dead ends: 19768 [2019-11-25 08:49:09,199 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:49:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-11-25 08:49:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-11-25 08:49:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-11-25 08:49:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-11-25 08:49:09,421 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-11-25 08:49:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,421 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-11-25 08:49:09,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-11-25 08:49:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-25 08:49:09,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,430 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] [2019-11-25 08:49:09,430 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:49:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash -787184031, now seen corresponding path program 1 times [2019-11-25 08:49:09,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029060718] [2019-11-25 08:49:09,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:09,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029060718] [2019-11-25 08:49:09,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:09,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087681591] [2019-11-25 08:49:09,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:09,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:09,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:09,519 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 5 states. [2019-11-25 08:49:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,566 INFO L93 Difference]: Finished difference Result 5640 states and 13144 transitions. [2019-11-25 08:49:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:49:09,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-11-25 08:49:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,570 INFO L225 Difference]: With dead ends: 5640 [2019-11-25 08:49:09,571 INFO L226 Difference]: Without dead ends: 4549 [2019-11-25 08:49:09,571 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:49:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2019-11-25 08:49:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 3948. [2019-11-25 08:49:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-11-25 08:49:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 9039 transitions. [2019-11-25 08:49:09,610 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 9039 transitions. Word has length 71 [2019-11-25 08:49:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,610 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 9039 transitions. [2019-11-25 08:49:09,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 9039 transitions. [2019-11-25 08:49:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:49:09,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,614 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:49:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1958096581, now seen corresponding path program 1 times [2019-11-25 08:49:09,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913345316] [2019-11-25 08:49:09,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:09,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913345316] [2019-11-25 08:49:09,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:09,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:49:09,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808735273] [2019-11-25 08:49:09,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:49:09,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:09,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:49:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:09,665 INFO L87 Difference]: Start difference. First operand 3948 states and 9039 transitions. Second operand 5 states. [2019-11-25 08:49:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:09,867 INFO L93 Difference]: Finished difference Result 4558 states and 10289 transitions. [2019-11-25 08:49:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:09,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-25 08:49:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:09,871 INFO L225 Difference]: With dead ends: 4558 [2019-11-25 08:49:09,871 INFO L226 Difference]: Without dead ends: 4527 [2019-11-25 08:49:09,872 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:49:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-11-25 08:49:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4087. [2019-11-25 08:49:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4087 states. [2019-11-25 08:49:09,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 9312 transitions. [2019-11-25 08:49:09,910 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 9312 transitions. Word has length 86 [2019-11-25 08:49:09,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:09,911 INFO L462 AbstractCegarLoop]: Abstraction has 4087 states and 9312 transitions. [2019-11-25 08:49:09,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:49:09,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 9312 transitions. [2019-11-25 08:49:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:49:09,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:09,915 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:49:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash 644532785, now seen corresponding path program 2 times [2019-11-25 08:49:09,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493581378] [2019-11-25 08:49:09,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:10,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493581378] [2019-11-25 08:49:10,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:10,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:49:10,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897142143] [2019-11-25 08:49:10,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:49:10,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:49:10,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:49:10,034 INFO L87 Difference]: Start difference. First operand 4087 states and 9312 transitions. Second operand 7 states. [2019-11-25 08:49:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:10,353 INFO L93 Difference]: Finished difference Result 5160 states and 11705 transitions. [2019-11-25 08:49:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:49:10,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-25 08:49:10,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:10,358 INFO L225 Difference]: With dead ends: 5160 [2019-11-25 08:49:10,358 INFO L226 Difference]: Without dead ends: 5142 [2019-11-25 08:49:10,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:49:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5142 states. [2019-11-25 08:49:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5142 to 4557. [2019-11-25 08:49:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4557 states. [2019-11-25 08:49:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 4557 states and 10375 transitions. [2019-11-25 08:49:10,404 INFO L78 Accepts]: Start accepts. Automaton has 4557 states and 10375 transitions. Word has length 86 [2019-11-25 08:49:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:10,405 INFO L462 AbstractCegarLoop]: Abstraction has 4557 states and 10375 transitions. [2019-11-25 08:49:10,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:49:10,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4557 states and 10375 transitions. [2019-11-25 08:49:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-25 08:49:10,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:10,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:10,409 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:49:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1152418574, now seen corresponding path program 1 times [2019-11-25 08:49:10,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:10,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103453742] [2019-11-25 08:49:10,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103453742] [2019-11-25 08:49:10,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:10,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:10,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677008521] [2019-11-25 08:49:10,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:10,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:10,501 INFO L87 Difference]: Start difference. First operand 4557 states and 10375 transitions. Second operand 6 states. [2019-11-25 08:49:10,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:10,639 INFO L93 Difference]: Finished difference Result 4512 states and 10162 transitions. [2019-11-25 08:49:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:49:10,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-25 08:49:10,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:10,643 INFO L225 Difference]: With dead ends: 4512 [2019-11-25 08:49:10,643 INFO L226 Difference]: Without dead ends: 4512 [2019-11-25 08:49:10,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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:49:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-11-25 08:49:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 2863. [2019-11-25 08:49:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2863 states. [2019-11-25 08:49:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2863 states and 6552 transitions. [2019-11-25 08:49:10,677 INFO L78 Accepts]: Start accepts. Automaton has 2863 states and 6552 transitions. Word has length 86 [2019-11-25 08:49:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:10,681 INFO L462 AbstractCegarLoop]: Abstraction has 2863 states and 6552 transitions. [2019-11-25 08:49:10,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 6552 transitions. [2019-11-25 08:49:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:49:10,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:10,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:10,685 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:49:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash -299623476, now seen corresponding path program 1 times [2019-11-25 08:49:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:10,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483275238] [2019-11-25 08:49:10,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:10,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483275238] [2019-11-25 08:49:10,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:10,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:49:10,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005478738] [2019-11-25 08:49:10,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:49:10,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:49:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:10,798 INFO L87 Difference]: Start difference. First operand 2863 states and 6552 transitions. Second operand 6 states. [2019-11-25 08:49:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,055 INFO L93 Difference]: Finished difference Result 3170 states and 7201 transitions. [2019-11-25 08:49:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:49:11,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-11-25 08:49:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,058 INFO L225 Difference]: With dead ends: 3170 [2019-11-25 08:49:11,058 INFO L226 Difference]: Without dead ends: 3170 [2019-11-25 08:49:11,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:49:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-11-25 08:49:11,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 2801. [2019-11-25 08:49:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2801 states. [2019-11-25 08:49:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2801 states to 2801 states and 6422 transitions. [2019-11-25 08:49:11,086 INFO L78 Accepts]: Start accepts. Automaton has 2801 states and 6422 transitions. Word has length 88 [2019-11-25 08:49:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:11,086 INFO L462 AbstractCegarLoop]: Abstraction has 2801 states and 6422 transitions. [2019-11-25 08:49:11,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:49:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2801 states and 6422 transitions. [2019-11-25 08:49:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:49:11,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:11,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,088 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:49:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1161956523, now seen corresponding path program 1 times [2019-11-25 08:49:11,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662884884] [2019-11-25 08:49:11,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:11,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662884884] [2019-11-25 08:49:11,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:11,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:49:11,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879530641] [2019-11-25 08:49:11,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:49:11,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:11,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:49:11,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:11,245 INFO L87 Difference]: Start difference. First operand 2801 states and 6422 transitions. Second operand 8 states. [2019-11-25 08:49:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,567 INFO L93 Difference]: Finished difference Result 3305 states and 7498 transitions. [2019-11-25 08:49:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:49:11,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-25 08:49:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,571 INFO L225 Difference]: With dead ends: 3305 [2019-11-25 08:49:11,571 INFO L226 Difference]: Without dead ends: 3305 [2019-11-25 08:49:11,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:49:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2019-11-25 08:49:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3168. [2019-11-25 08:49:11,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-11-25 08:49:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-11-25 08:49:11,601 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-11-25 08:49:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:11,601 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-11-25 08:49:11,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:49:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-11-25 08:49:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:49:11,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:11,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,604 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:49:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2049460204, now seen corresponding path program 1 times [2019-11-25 08:49:11,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544277402] [2019-11-25 08:49:11,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:11,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544277402] [2019-11-25 08:49:11,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:11,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-25 08:49:11,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721121105] [2019-11-25 08:49:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:49:11,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:49:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:49:11,760 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 8 states. [2019-11-25 08:49:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,878 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-11-25 08:49:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:49:11,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-11-25 08:49:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:11,882 INFO L225 Difference]: With dead ends: 5381 [2019-11-25 08:49:11,882 INFO L226 Difference]: Without dead ends: 2305 [2019-11-25 08:49:11,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:49:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-11-25 08:49:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-11-25 08:49:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-11-25 08:49:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-11-25 08:49:11,911 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-11-25 08:49:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:11,912 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-11-25 08:49:11,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:49:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-11-25 08:49:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:49:11,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,915 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:49:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash 502510154, now seen corresponding path program 2 times [2019-11-25 08:49:11,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056445597] [2019-11-25 08:49:11,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:12,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056445597] [2019-11-25 08:49:12,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:12,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-25 08:49:12,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576539161] [2019-11-25 08:49:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:49:12,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:12,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:49:12,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:49:12,104 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-11-25 08:49:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:12,452 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-11-25 08:49:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:49:12,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-11-25 08:49:12,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:49:12,454 INFO L225 Difference]: With dead ends: 3951 [2019-11-25 08:49:12,455 INFO L226 Difference]: Without dead ends: 2572 [2019-11-25 08:49:12,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:49:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-11-25 08:49:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-11-25 08:49:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-11-25 08:49:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-11-25 08:49:12,476 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-11-25 08:49:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:49:12,476 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-11-25 08:49:12,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:49:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-11-25 08:49:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:49:12,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:49:12,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:12,478 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:49:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1568953738, now seen corresponding path program 3 times [2019-11-25 08:49:12,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:12,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641610096] [2019-11-25 08:49:12,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:12,548 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:12,548 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:49:12,736 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-25 08:49:12,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:49:12 BasicIcfg [2019-11-25 08:49:12,738 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:49:12,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:12,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:12,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:12,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:48:45" (3/4) ... [2019-11-25 08:49:12,741 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:49:12,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4cb23d55-3c7a-4e33-92b2-974448f2dfc2/bin/uautomizer/witness.graphml [2019-11-25 08:49:12,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:12,904 INFO L168 Benchmark]: Toolchain (without parser) took 28586.85 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 944.7 MB in the beginning and 923.0 MB in the end (delta: 21.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,904 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:49:12,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 653.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,905 INFO L168 Benchmark]: Boogie Preprocessor took 43.11 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:49:12,906 INFO L168 Benchmark]: RCFGBuilder took 623.71 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,906 INFO L168 Benchmark]: TraceAbstraction took 27049.44 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 975.9 MB in the end (delta: 72.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,907 INFO L168 Benchmark]: Witness Printer took 163.88 ms. Allocated memory is still 3.2 GB. Free memory was 975.9 MB in the beginning and 923.0 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:12,908 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.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 623.71 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27049.44 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 975.9 MB in the end (delta: 72.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 163.88 ms. Allocated memory is still 3.2 GB. Free memory was 975.9 MB in the beginning and 923.0 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] 0 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 331 locations, 5 error locations. Result: UNSAFE, OverallTime: 26.7s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6192 SDtfs, 6963 SDslu, 13882 SDs, 0 SdLazy, 4870 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 61 SyntacticMatches, 11 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 45626 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1749 NumberOfCodeBlocks, 1749 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1637 ConstructedInterpolants, 0 QuantifiedInterpolants, 320245 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...