/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/thin001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:19:37,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:19:37,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:19:37,146 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:19:37,146 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:19:37,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:19:37,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:19:37,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:19:37,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:19:37,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:19:37,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:19:37,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:19:37,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:19:37,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:19:37,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:19:37,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:19:37,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:19:37,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:19:37,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:19:37,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:19:37,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:19:37,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:19:37,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:19:37,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:19:37,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:19:37,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:19:37,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:19:37,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:19:37,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:19:37,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:19:37,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:19:37,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:19:37,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:19:37,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:19:37,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:19:37,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:19:37,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:19:37,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:19:37,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:19:37,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:19:37,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:19:37,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:19:37,199 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:19:37,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:19:37,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:19:37,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:19:37,202 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:19:37,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:19:37,202 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:19:37,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:19:37,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:19:37,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:19:37,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:19:37,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:19:37,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:19:37,205 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:19:37,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:19:37,205 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:19:37,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:19:37,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:19:37,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:19:37,206 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:19:37,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:19:37,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:19:37,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:19:37,207 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:19:37,207 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:19:37,207 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:19:37,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:19:37,207 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:19:37,208 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:19:37,208 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:19:37,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:19:37,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:19:37,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:19:37,508 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:19:37,508 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:19:37,509 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin001_power.opt.i [2019-12-27 00:19:37,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321d82777/cf9fc5cfb7394d9495f6c1278b6caf18/FLAG77e59f714 [2019-12-27 00:19:38,132 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:19:38,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin001_power.opt.i [2019-12-27 00:19:38,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321d82777/cf9fc5cfb7394d9495f6c1278b6caf18/FLAG77e59f714 [2019-12-27 00:19:38,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321d82777/cf9fc5cfb7394d9495f6c1278b6caf18 [2019-12-27 00:19:38,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:19:38,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:19:38,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:19:38,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:19:38,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:19:38,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:19:38" (1/1) ... [2019-12-27 00:19:38,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7f0ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:38, skipping insertion in model container [2019-12-27 00:19:38,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:19:38" (1/1) ... [2019-12-27 00:19:38,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:19:38,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:19:38,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:19:38,962 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:19:39,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:19:39,136 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:19:39,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39 WrapperNode [2019-12-27 00:19:39,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:19:39,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:19:39,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:19:39,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:19:39,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:19:39,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:19:39,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:19:39,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:19:39,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... [2019-12-27 00:19:39,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:19:39,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:19:39,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:19:39,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:19:39,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-27 00:19:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 00:19:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:19:39,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 00:19:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:19:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:19:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 00:19:39,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 00:19:39,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 00:19:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 00:19:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 00:19:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 00:19:39,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 00:19:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 00:19:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:19:39,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:19:39,337 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 00:19:40,282 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:19:40,282 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 00:19:40,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:19:40 BoogieIcfgContainer [2019-12-27 00:19:40,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:19:40,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:19:40,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:19:40,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:19:40,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:19:38" (1/3) ... [2019-12-27 00:19:40,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9dbb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:19:40, skipping insertion in model container [2019-12-27 00:19:40,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:19:39" (2/3) ... [2019-12-27 00:19:40,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9dbb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:19:40, skipping insertion in model container [2019-12-27 00:19:40,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:19:40" (3/3) ... [2019-12-27 00:19:40,292 INFO L109 eAbstractionObserver]: Analyzing ICFG thin001_power.opt.i [2019-12-27 00:19:40,301 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:19:40,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:19:40,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 00:19:40,310 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:19:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,357 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,425 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,427 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:19:40,446 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:19:40,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:19:40,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:19:40,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:19:40,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:19:40,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:19:40,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:19:40,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:19:40,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:19:40,489 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 276 transitions [2019-12-27 00:19:40,491 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-27 00:19:40,617 INFO L132 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-27 00:19:40,617 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:19:40,641 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 666 event pairs. 0/209 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 00:19:40,680 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-27 00:19:40,756 INFO L132 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-27 00:19:40,756 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:19:40,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 666 event pairs. 0/209 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-27 00:19:40,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22870 [2019-12-27 00:19:40,800 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:19:49,544 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-12-27 00:19:49,708 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-27 00:19:50,231 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2019-12-27 00:19:50,506 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-12-27 00:19:50,537 INFO L206 etLargeBlockEncoding]: Checked pairs total: 113419 [2019-12-27 00:19:50,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-27 00:19:50,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 133 transitions [2019-12-27 00:19:52,622 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32514 states. [2019-12-27 00:19:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 32514 states. [2019-12-27 00:19:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 00:19:52,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:19:52,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 00:19:52,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:19:52,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:19:52,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1148437831, now seen corresponding path program 1 times [2019-12-27 00:19:52,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:19:52,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120059162] [2019-12-27 00:19:52,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:19:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:19:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:19:52,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120059162] [2019-12-27 00:19:52,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:19:52,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:19:52,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071202020] [2019-12-27 00:19:52,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:19:52,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:19:52,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:19:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:19:52,891 INFO L87 Difference]: Start difference. First operand 32514 states. Second operand 3 states. [2019-12-27 00:19:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:19:54,427 INFO L93 Difference]: Finished difference Result 31858 states and 127030 transitions. [2019-12-27 00:19:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:19:54,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 00:19:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:19:54,760 INFO L225 Difference]: With dead ends: 31858 [2019-12-27 00:19:54,761 INFO L226 Difference]: Without dead ends: 30394 [2019-12-27 00:19:54,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 00:19:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30394 states. [2019-12-27 00:19:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30394 to 30394. [2019-12-27 00:19:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30394 states. [2019-12-27 00:19:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30394 states to 30394 states and 121136 transitions. [2019-12-27 00:19:56,458 INFO L78 Accepts]: Start accepts. Automaton has 30394 states and 121136 transitions. Word has length 5 [2019-12-27 00:19:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:19:56,459 INFO L462 AbstractCegarLoop]: Abstraction has 30394 states and 121136 transitions. [2019-12-27 00:19:56,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:19:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30394 states and 121136 transitions. [2019-12-27 00:19:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:19:56,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:19:56,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:19:56,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:19:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:19:56,466 INFO L82 PathProgramCache]: Analyzing trace with hash 816039134, now seen corresponding path program 1 times [2019-12-27 00:19:56,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:19:56,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431993685] [2019-12-27 00:19:56,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:19:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:19:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:19:56,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431993685] [2019-12-27 00:19:56,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:19:56,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:19:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881781821] [2019-12-27 00:19:56,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:19:56,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:19:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:19:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:19:56,599 INFO L87 Difference]: Start difference. First operand 30394 states and 121136 transitions. Second operand 4 states. [2019-12-27 00:19:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:19:58,870 INFO L93 Difference]: Finished difference Result 48598 states and 183912 transitions. [2019-12-27 00:19:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:19:58,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 00:19:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:19:59,116 INFO L225 Difference]: With dead ends: 48598 [2019-12-27 00:19:59,116 INFO L226 Difference]: Without dead ends: 48584 [2019-12-27 00:19:59,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-27 00:19:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2019-12-27 00:20:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 44998. [2019-12-27 00:20:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44998 states. [2019-12-27 00:20:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44998 states to 44998 states and 172210 transitions. [2019-12-27 00:20:00,692 INFO L78 Accepts]: Start accepts. Automaton has 44998 states and 172210 transitions. Word has length 13 [2019-12-27 00:20:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:00,693 INFO L462 AbstractCegarLoop]: Abstraction has 44998 states and 172210 transitions. [2019-12-27 00:20:00,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:20:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 44998 states and 172210 transitions. [2019-12-27 00:20:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:20:00,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:00,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:00,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -612690505, now seen corresponding path program 1 times [2019-12-27 00:20:00,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:00,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718881062] [2019-12-27 00:20:00,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:00,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718881062] [2019-12-27 00:20:00,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:00,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:20:00,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512774937] [2019-12-27 00:20:00,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:00,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:00,875 INFO L87 Difference]: Start difference. First operand 44998 states and 172210 transitions. Second operand 5 states. [2019-12-27 00:20:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:01,889 INFO L93 Difference]: Finished difference Result 66878 states and 251204 transitions. [2019-12-27 00:20:01,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:20:01,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 00:20:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:02,164 INFO L225 Difference]: With dead ends: 66878 [2019-12-27 00:20:02,165 INFO L226 Difference]: Without dead ends: 66878 [2019-12-27 00:20:02,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66878 states. [2019-12-27 00:20:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66878 to 51580. [2019-12-27 00:20:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51580 states. [2019-12-27 00:20:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51580 states to 51580 states and 196291 transitions. [2019-12-27 00:20:06,117 INFO L78 Accepts]: Start accepts. Automaton has 51580 states and 196291 transitions. Word has length 16 [2019-12-27 00:20:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:06,118 INFO L462 AbstractCegarLoop]: Abstraction has 51580 states and 196291 transitions. [2019-12-27 00:20:06,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand 51580 states and 196291 transitions. [2019-12-27 00:20:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:20:06,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:06,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:06,126 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:06,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash -612492787, now seen corresponding path program 1 times [2019-12-27 00:20:06,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:06,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605436595] [2019-12-27 00:20:06,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:06,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605436595] [2019-12-27 00:20:06,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:06,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:06,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806336054] [2019-12-27 00:20:06,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:06,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:06,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:06,173 INFO L87 Difference]: Start difference. First operand 51580 states and 196291 transitions. Second operand 3 states. [2019-12-27 00:20:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:06,517 INFO L93 Difference]: Finished difference Result 68690 states and 256962 transitions. [2019-12-27 00:20:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:06,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 00:20:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:07,328 INFO L225 Difference]: With dead ends: 68690 [2019-12-27 00:20:07,328 INFO L226 Difference]: Without dead ends: 68690 [2019-12-27 00:20:07,328 INFO L631 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-12-27 00:20:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68690 states. [2019-12-27 00:20:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68690 to 57838. [2019-12-27 00:20:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57838 states. [2019-12-27 00:20:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57838 states to 57838 states and 217912 transitions. [2019-12-27 00:20:08,912 INFO L78 Accepts]: Start accepts. Automaton has 57838 states and 217912 transitions. Word has length 16 [2019-12-27 00:20:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:08,912 INFO L462 AbstractCegarLoop]: Abstraction has 57838 states and 217912 transitions. [2019-12-27 00:20:08,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57838 states and 217912 transitions. [2019-12-27 00:20:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 00:20:08,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:08,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:08,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:08,921 INFO L82 PathProgramCache]: Analyzing trace with hash 742083143, now seen corresponding path program 1 times [2019-12-27 00:20:08,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:08,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697566832] [2019-12-27 00:20:08,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:09,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697566832] [2019-12-27 00:20:09,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:09,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:20:09,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431082718] [2019-12-27 00:20:09,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:09,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:09,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:09,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:09,012 INFO L87 Difference]: Start difference. First operand 57838 states and 217912 transitions. Second operand 5 states. [2019-12-27 00:20:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:11,945 INFO L93 Difference]: Finished difference Result 72076 states and 269083 transitions. [2019-12-27 00:20:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 00:20:11,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 00:20:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:12,177 INFO L225 Difference]: With dead ends: 72076 [2019-12-27 00:20:12,177 INFO L226 Difference]: Without dead ends: 72076 [2019-12-27 00:20:12,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72076 states. [2019-12-27 00:20:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72076 to 57278. [2019-12-27 00:20:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57278 states. [2019-12-27 00:20:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57278 states to 57278 states and 216046 transitions. [2019-12-27 00:20:13,546 INFO L78 Accepts]: Start accepts. Automaton has 57278 states and 216046 transitions. Word has length 16 [2019-12-27 00:20:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:13,546 INFO L462 AbstractCegarLoop]: Abstraction has 57278 states and 216046 transitions. [2019-12-27 00:20:13,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 57278 states and 216046 transitions. [2019-12-27 00:20:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 00:20:13,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:13,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:13,572 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:13,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1834139520, now seen corresponding path program 1 times [2019-12-27 00:20:13,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:13,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977391027] [2019-12-27 00:20:13,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:13,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977391027] [2019-12-27 00:20:13,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:13,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:13,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095722333] [2019-12-27 00:20:13,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:20:13,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:13,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:20:13,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:20:13,684 INFO L87 Difference]: Start difference. First operand 57278 states and 216046 transitions. Second operand 4 states. [2019-12-27 00:20:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:13,824 INFO L93 Difference]: Finished difference Result 34233 states and 112196 transitions. [2019-12-27 00:20:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:20:13,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 00:20:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:13,893 INFO L225 Difference]: With dead ends: 34233 [2019-12-27 00:20:13,894 INFO L226 Difference]: Without dead ends: 31833 [2019-12-27 00:20:13,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-27 00:20:14,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31833 states. [2019-12-27 00:20:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31833 to 31833. [2019-12-27 00:20:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31833 states. [2019-12-27 00:20:14,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31833 states to 31833 states and 104321 transitions. [2019-12-27 00:20:14,933 INFO L78 Accepts]: Start accepts. Automaton has 31833 states and 104321 transitions. Word has length 20 [2019-12-27 00:20:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:14,933 INFO L462 AbstractCegarLoop]: Abstraction has 31833 states and 104321 transitions. [2019-12-27 00:20:14,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:20:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31833 states and 104321 transitions. [2019-12-27 00:20:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:14,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:14,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:14,942 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 531566131, now seen corresponding path program 1 times [2019-12-27 00:20:14,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:14,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292026475] [2019-12-27 00:20:14,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:15,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292026475] [2019-12-27 00:20:15,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:15,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:20:15,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319485056] [2019-12-27 00:20:15,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:15,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:15,021 INFO L87 Difference]: Start difference. First operand 31833 states and 104321 transitions. Second operand 3 states. [2019-12-27 00:20:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:15,123 INFO L93 Difference]: Finished difference Result 30572 states and 99210 transitions. [2019-12-27 00:20:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:15,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 00:20:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:15,180 INFO L225 Difference]: With dead ends: 30572 [2019-12-27 00:20:15,180 INFO L226 Difference]: Without dead ends: 30572 [2019-12-27 00:20:15,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:15,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30572 states. [2019-12-27 00:20:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30572 to 30386. [2019-12-27 00:20:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30386 states. [2019-12-27 00:20:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30386 states to 30386 states and 98664 transitions. [2019-12-27 00:20:15,700 INFO L78 Accepts]: Start accepts. Automaton has 30386 states and 98664 transitions. Word has length 21 [2019-12-27 00:20:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:15,701 INFO L462 AbstractCegarLoop]: Abstraction has 30386 states and 98664 transitions. [2019-12-27 00:20:15,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 30386 states and 98664 transitions. [2019-12-27 00:20:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:15,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:15,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:15,708 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:15,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:15,708 INFO L82 PathProgramCache]: Analyzing trace with hash -385683241, now seen corresponding path program 1 times [2019-12-27 00:20:15,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:15,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150259575] [2019-12-27 00:20:15,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:15,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150259575] [2019-12-27 00:20:15,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:15,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 00:20:15,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656835735] [2019-12-27 00:20:15,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:15,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:15,784 INFO L87 Difference]: Start difference. First operand 30386 states and 98664 transitions. Second operand 5 states. [2019-12-27 00:20:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:16,095 INFO L93 Difference]: Finished difference Result 5545 states and 15258 transitions. [2019-12-27 00:20:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:20:16,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:20:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:16,102 INFO L225 Difference]: With dead ends: 5545 [2019-12-27 00:20:16,103 INFO L226 Difference]: Without dead ends: 4300 [2019-12-27 00:20:16,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-27 00:20:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2019-12-27 00:20:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4252. [2019-12-27 00:20:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4252 states. [2019-12-27 00:20:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 11137 transitions. [2019-12-27 00:20:16,160 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 11137 transitions. Word has length 21 [2019-12-27 00:20:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:16,160 INFO L462 AbstractCegarLoop]: Abstraction has 4252 states and 11137 transitions. [2019-12-27 00:20:16,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 11137 transitions. [2019-12-27 00:20:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:20:16,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:16,164 INFO L411 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] [2019-12-27 00:20:16,164 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:16,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:16,164 INFO L82 PathProgramCache]: Analyzing trace with hash 849569807, now seen corresponding path program 1 times [2019-12-27 00:20:16,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:16,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561872241] [2019-12-27 00:20:16,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:16,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561872241] [2019-12-27 00:20:16,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:16,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:16,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901983902] [2019-12-27 00:20:16,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:20:16,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:20:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:20:16,303 INFO L87 Difference]: Start difference. First operand 4252 states and 11137 transitions. Second operand 6 states. [2019-12-27 00:20:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:16,741 INFO L93 Difference]: Finished difference Result 5485 states and 14002 transitions. [2019-12-27 00:20:16,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 00:20:16,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 00:20:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:16,748 INFO L225 Difference]: With dead ends: 5485 [2019-12-27 00:20:16,748 INFO L226 Difference]: Without dead ends: 5437 [2019-12-27 00:20:16,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-12-27 00:20:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4351. [2019-12-27 00:20:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-12-27 00:20:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 11378 transitions. [2019-12-27 00:20:16,797 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 11378 transitions. Word has length 27 [2019-12-27 00:20:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:16,798 INFO L462 AbstractCegarLoop]: Abstraction has 4351 states and 11378 transitions. [2019-12-27 00:20:16,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:20:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 11378 transitions. [2019-12-27 00:20:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:20:16,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:16,802 INFO L411 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] [2019-12-27 00:20:16,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1399306623, now seen corresponding path program 1 times [2019-12-27 00:20:16,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:16,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759367806] [2019-12-27 00:20:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:16,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759367806] [2019-12-27 00:20:16,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:16,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:16,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456014881] [2019-12-27 00:20:16,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:16,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:16,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:16,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:16,846 INFO L87 Difference]: Start difference. First operand 4351 states and 11378 transitions. Second operand 3 states. [2019-12-27 00:20:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:16,888 INFO L93 Difference]: Finished difference Result 5219 states and 13168 transitions. [2019-12-27 00:20:16,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:16,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 00:20:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:16,896 INFO L225 Difference]: With dead ends: 5219 [2019-12-27 00:20:16,896 INFO L226 Difference]: Without dead ends: 5219 [2019-12-27 00:20:16,897 INFO L631 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-12-27 00:20:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-27 00:20:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4335. [2019-12-27 00:20:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2019-12-27 00:20:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11088 transitions. [2019-12-27 00:20:16,952 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11088 transitions. Word has length 27 [2019-12-27 00:20:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:16,953 INFO L462 AbstractCegarLoop]: Abstraction has 4335 states and 11088 transitions. [2019-12-27 00:20:16,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11088 transitions. [2019-12-27 00:20:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 00:20:16,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:16,957 INFO L411 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] [2019-12-27 00:20:16,957 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1834461847, now seen corresponding path program 1 times [2019-12-27 00:20:16,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:16,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237313356] [2019-12-27 00:20:16,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:17,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237313356] [2019-12-27 00:20:17,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:17,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:17,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140348389] [2019-12-27 00:20:17,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:20:17,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:17,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:20:17,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:20:17,058 INFO L87 Difference]: Start difference. First operand 4335 states and 11088 transitions. Second operand 6 states. [2019-12-27 00:20:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:17,647 INFO L93 Difference]: Finished difference Result 7824 states and 19768 transitions. [2019-12-27 00:20:17,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 00:20:17,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 00:20:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:17,657 INFO L225 Difference]: With dead ends: 7824 [2019-12-27 00:20:17,657 INFO L226 Difference]: Without dead ends: 7766 [2019-12-27 00:20:17,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 00:20:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-12-27 00:20:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 4183. [2019-12-27 00:20:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2019-12-27 00:20:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 10699 transitions. [2019-12-27 00:20:17,718 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 10699 transitions. Word has length 28 [2019-12-27 00:20:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:17,718 INFO L462 AbstractCegarLoop]: Abstraction has 4183 states and 10699 transitions. [2019-12-27 00:20:17,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:20:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 10699 transitions. [2019-12-27 00:20:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 00:20:17,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:17,723 INFO L411 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] [2019-12-27 00:20:17,723 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1865234292, now seen corresponding path program 1 times [2019-12-27 00:20:17,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:17,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848453212] [2019-12-27 00:20:17,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:17,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848453212] [2019-12-27 00:20:17,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:17,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:17,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657656767] [2019-12-27 00:20:17,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 00:20:17,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 00:20:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 00:20:17,811 INFO L87 Difference]: Start difference. First operand 4183 states and 10699 transitions. Second operand 6 states. [2019-12-27 00:20:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:17,876 INFO L93 Difference]: Finished difference Result 2573 states and 6950 transitions. [2019-12-27 00:20:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:17,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 00:20:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:17,880 INFO L225 Difference]: With dead ends: 2573 [2019-12-27 00:20:17,881 INFO L226 Difference]: Without dead ends: 2464 [2019-12-27 00:20:17,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-27 00:20:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2019-12-27 00:20:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-12-27 00:20:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 6706 transitions. [2019-12-27 00:20:17,912 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 6706 transitions. Word has length 32 [2019-12-27 00:20:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:17,912 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 6706 transitions. [2019-12-27 00:20:17,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 00:20:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 6706 transitions. [2019-12-27 00:20:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:20:17,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:17,917 INFO L411 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-12-27 00:20:17,917 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:17,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 920348685, now seen corresponding path program 1 times [2019-12-27 00:20:17,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:17,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52826001] [2019-12-27 00:20:17,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:17,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52826001] [2019-12-27 00:20:17,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:17,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:17,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538142607] [2019-12-27 00:20:17,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:17,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:17,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:17,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:17,960 INFO L87 Difference]: Start difference. First operand 2464 states and 6706 transitions. Second operand 3 states. [2019-12-27 00:20:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:18,161 INFO L93 Difference]: Finished difference Result 3224 states and 8738 transitions. [2019-12-27 00:20:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:18,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 00:20:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:18,167 INFO L225 Difference]: With dead ends: 3224 [2019-12-27 00:20:18,167 INFO L226 Difference]: Without dead ends: 3224 [2019-12-27 00:20:18,167 INFO L631 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-12-27 00:20:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-12-27 00:20:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2744. [2019-12-27 00:20:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-27 00:20:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 7458 transitions. [2019-12-27 00:20:18,201 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 7458 transitions. Word has length 57 [2019-12-27 00:20:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:18,202 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 7458 transitions. [2019-12-27 00:20:18,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 7458 transitions. [2019-12-27 00:20:18,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 00:20:18,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:18,206 INFO L411 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-12-27 00:20:18,206 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:18,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:18,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2004340659, now seen corresponding path program 2 times [2019-12-27 00:20:18,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:18,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274506455] [2019-12-27 00:20:18,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:18,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274506455] [2019-12-27 00:20:18,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:18,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:20:18,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189795693] [2019-12-27 00:20:18,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:18,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:18,290 INFO L87 Difference]: Start difference. First operand 2744 states and 7458 transitions. Second operand 3 states. [2019-12-27 00:20:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:18,365 INFO L93 Difference]: Finished difference Result 3078 states and 8141 transitions. [2019-12-27 00:20:18,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:18,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 00:20:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:18,370 INFO L225 Difference]: With dead ends: 3078 [2019-12-27 00:20:18,370 INFO L226 Difference]: Without dead ends: 3078 [2019-12-27 00:20:18,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-12-27 00:20:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2570. [2019-12-27 00:20:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-27 00:20:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 6869 transitions. [2019-12-27 00:20:18,416 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 6869 transitions. Word has length 57 [2019-12-27 00:20:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:18,417 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 6869 transitions. [2019-12-27 00:20:18,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 6869 transitions. [2019-12-27 00:20:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 00:20:18,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:18,423 INFO L411 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] [2019-12-27 00:20:18,423 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:18,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash -320339371, now seen corresponding path program 1 times [2019-12-27 00:20:18,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:18,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890145404] [2019-12-27 00:20:18,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:18,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890145404] [2019-12-27 00:20:18,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:18,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:18,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194018391] [2019-12-27 00:20:18,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:18,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:18,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:18,540 INFO L87 Difference]: Start difference. First operand 2570 states and 6869 transitions. Second operand 3 states. [2019-12-27 00:20:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:18,556 INFO L93 Difference]: Finished difference Result 2569 states and 6867 transitions. [2019-12-27 00:20:18,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:18,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 00:20:18,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:18,561 INFO L225 Difference]: With dead ends: 2569 [2019-12-27 00:20:18,561 INFO L226 Difference]: Without dead ends: 2569 [2019-12-27 00:20:18,562 INFO L631 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-12-27 00:20:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-12-27 00:20:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2569. [2019-12-27 00:20:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-12-27 00:20:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 6867 transitions. [2019-12-27 00:20:18,601 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 6867 transitions. Word has length 58 [2019-12-27 00:20:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:18,601 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 6867 transitions. [2019-12-27 00:20:18,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 6867 transitions. [2019-12-27 00:20:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 00:20:18,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:18,607 INFO L411 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] [2019-12-27 00:20:18,607 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:18,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1355522643, now seen corresponding path program 1 times [2019-12-27 00:20:18,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:18,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011223837] [2019-12-27 00:20:18,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:19,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011223837] [2019-12-27 00:20:19,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:19,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 00:20:19,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373039381] [2019-12-27 00:20:19,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 00:20:19,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:19,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 00:20:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:19,168 INFO L87 Difference]: Start difference. First operand 2569 states and 6867 transitions. Second operand 17 states. [2019-12-27 00:20:19,684 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-12-27 00:20:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:21,649 INFO L93 Difference]: Finished difference Result 8147 states and 20793 transitions. [2019-12-27 00:20:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 00:20:21,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 00:20:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:21,657 INFO L225 Difference]: With dead ends: 8147 [2019-12-27 00:20:21,657 INFO L226 Difference]: Without dead ends: 4701 [2019-12-27 00:20:21,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 00:20:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4701 states. [2019-12-27 00:20:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4701 to 2553. [2019-12-27 00:20:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 00:20:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 6804 transitions. [2019-12-27 00:20:21,691 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 6804 transitions. Word has length 59 [2019-12-27 00:20:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:21,692 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 6804 transitions. [2019-12-27 00:20:21,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 00:20:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 6804 transitions. [2019-12-27 00:20:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 00:20:21,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:21,695 INFO L411 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] [2019-12-27 00:20:21,695 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1895337163, now seen corresponding path program 2 times [2019-12-27 00:20:21,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:21,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517709794] [2019-12-27 00:20:21,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:21,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517709794] [2019-12-27 00:20:21,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:21,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:21,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910836782] [2019-12-27 00:20:21,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:21,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:21,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:21,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:21,784 INFO L87 Difference]: Start difference. First operand 2553 states and 6804 transitions. Second operand 5 states. [2019-12-27 00:20:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:21,822 INFO L93 Difference]: Finished difference Result 3455 states and 8752 transitions. [2019-12-27 00:20:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:20:21,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 00:20:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:21,824 INFO L225 Difference]: With dead ends: 3455 [2019-12-27 00:20:21,825 INFO L226 Difference]: Without dead ends: 987 [2019-12-27 00:20:21,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2019-12-27 00:20:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2019-12-27 00:20:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-27 00:20:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2108 transitions. [2019-12-27 00:20:21,839 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2108 transitions. Word has length 59 [2019-12-27 00:20:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:21,839 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2108 transitions. [2019-12-27 00:20:21,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2108 transitions. [2019-12-27 00:20:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 00:20:21,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:21,841 INFO L411 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] [2019-12-27 00:20:21,841 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1593378973, now seen corresponding path program 3 times [2019-12-27 00:20:21,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:21,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142289242] [2019-12-27 00:20:21,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142289242] [2019-12-27 00:20:21,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:21,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:21,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882994328] [2019-12-27 00:20:21,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:21,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:21,970 INFO L87 Difference]: Start difference. First operand 987 states and 2108 transitions. Second operand 5 states. [2019-12-27 00:20:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:22,009 INFO L93 Difference]: Finished difference Result 1186 states and 2490 transitions. [2019-12-27 00:20:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 00:20:22,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-27 00:20:22,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:22,010 INFO L225 Difference]: With dead ends: 1186 [2019-12-27 00:20:22,010 INFO L226 Difference]: Without dead ends: 248 [2019-12-27 00:20:22,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-27 00:20:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-12-27 00:20:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-27 00:20:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 446 transitions. [2019-12-27 00:20:22,016 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 446 transitions. Word has length 59 [2019-12-27 00:20:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:22,017 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 446 transitions. [2019-12-27 00:20:22,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:22,017 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 446 transitions. [2019-12-27 00:20:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 00:20:22,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:22,018 INFO L411 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] [2019-12-27 00:20:22,019 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:22,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:22,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1947312003, now seen corresponding path program 4 times [2019-12-27 00:20:22,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:22,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538046569] [2019-12-27 00:20:22,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:22,227 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:20:22,228 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:20:22,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse1 (store |v_#valid_78| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_164| 1))) (and (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8) (< 0 |v_#StackHeapBarrier_25|) (= v_~z~0_24 0) (= 0 v_~y$r_buff1_thd2~0_265) (= 0 v_~__unbuffered_cnt~0_71) (= v_~y$r_buff1_thd0~0_314 0) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45) (= |v_#memory_int_298| (store |v_#memory_int_299| |v_ULTIMATE.start_main_~#t2684~0.base_22| (store (select |v_#memory_int_299| |v_ULTIMATE.start_main_~#t2684~0.base_22|) |v_ULTIMATE.start_main_~#t2684~0.offset_17| 0))) (= v_~y$mem_tmp~0_15 0) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= 0 v_~weak$$choice1~0_99) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2684~0.base_22|)) (= 0 v_~y$r_buff0_thd2~0_413) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd1~0_225 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= 0 |v_#NULL.base_5|) (= |v_ULTIMATE.start_main_~#t2684~0.offset_17| 0) (= v_~main$tmp_guard0~0_51 0) (= 0 v_~y$read_delayed_var~0.base_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t2684~0.base_22| 1) |v_#valid_76|) (= 0 v_~y$w_buff0~0_1532) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t2684~0.base_22|) (= 0 v_~__unbuffered_p0_EAX~0_40) (= 0 v_~y$r_buff0_thd3~0_885) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7) (= v_~y$r_buff0_thd0~0_245 0) (= 0 |v_~#y~0.offset_164|) (= 0 v_~y$w_buff1_used~0_1325) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7) (= v_~y$w_buff1~0_855 0) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= v_~main$tmp_guard1~0_30 0) (= v_~y$w_buff0_used~0_2077 0) (= 0 v_~weak$$choice0~0_215) (= |v_#length_37| (store (store |v_#length_39| |v_~#y~0.base_164| 4) |v_ULTIMATE.start_main_~#t2684~0.base_22| 4)) (= v_~weak$$choice2~0_122 0) (= (select .cse1 |v_~#y~0.base_164|) 0) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_8) (= v_~y$r_buff0_thd1~0_140 0) (= 0 v_~y$r_buff1_thd3~0_805) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (< |v_#StackHeapBarrier_25| |v_~#y~0.base_164|) (= v_~__unbuffered_p1_EAX~0_749 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$flush_delayed~0_26) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_8) (= 0 v_~x~0_741) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8) (= (select (select |v_#memory_int_299| |v_~#y~0.base_164|) |v_~#y~0.offset_164|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_299|, #length=|v_#length_39|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_65|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2686~0.offset=|v_ULTIMATE.start_main_~#t2686~0.offset_15|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_83|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_86|, ~weak$$choice1~0=v_~weak$$choice1~0_99, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_805, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_749, ULTIMATE.start_main_~#t2684~0.base=|v_ULTIMATE.start_main_~#t2684~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_35|, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_8, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_22|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_7|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_55|, ULTIMATE.start_main_~#t2684~0.offset=|v_ULTIMATE.start_main_~#t2684~0.offset_17|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_85|, ~weak$$choice0~0=v_~weak$$choice0~0_215, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ~y$w_buff1~0=v_~y$w_buff1~0_855, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_413, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, ULTIMATE.start_main_~#t2685~0.base=|v_ULTIMATE.start_main_~#t2685~0.base_21|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_741, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~#y~0.offset=|v_~#y~0.offset_164|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_2077, ULTIMATE.start_main_~#t2686~0.base=|v_ULTIMATE.start_main_~#t2686~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~#y~0.base=|v_~#y~0.base_164|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_225, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_59|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_141|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ~y$w_buff0~0=v_~y$w_buff0~0_1532, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_885, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7, ULTIMATE.start_main_~#t2685~0.offset=|v_ULTIMATE.start_main_~#t2685~0.offset_15|, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_7|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_51, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_42|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_8, #NULL.base=|v_#NULL.base_5|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_245, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_298|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_122, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_90|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_1325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, #NULL.offset, ULTIMATE.start_main_~#t2686~0.offset, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~weak$$choice1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t2684~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem77, ~__unbuffered_p2_EAX$w_buff0~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~nondet66, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_~#t2684~0.offset, ULTIMATE.start_main_#t~ite75, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2685~0.base, ~y$r_buff1_thd0~0, ~x~0, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2686~0.base, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~__unbuffered_p2_EAX$w_buff1_used~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ULTIMATE.start_main_~#t2685~0.offset, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet67, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_#t~mem69, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:20:22,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L837-1-->L839: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t2685~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t2685~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2685~0.base_12| 4)) (= (store |v_#memory_int_214| |v_ULTIMATE.start_main_~#t2685~0.base_12| (store (select |v_#memory_int_214| |v_ULTIMATE.start_main_~#t2685~0.base_12|) |v_ULTIMATE.start_main_~#t2685~0.offset_10| 1)) |v_#memory_int_213|) (= |v_ULTIMATE.start_main_~#t2685~0.offset_10| 0) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t2685~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2685~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_214|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_4|, #memory_int=|v_#memory_int_213|, ULTIMATE.start_main_~#t2685~0.offset=|v_ULTIMATE.start_main_~#t2685~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t2685~0.base=|v_ULTIMATE.start_main_~#t2685~0.base_12|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet66, #memory_int, ULTIMATE.start_main_~#t2685~0.offset, #length, ULTIMATE.start_main_~#t2685~0.base] because there is no mapped edge [2019-12-27 00:20:22,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1124] [1124] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t2686~0.offset_9| 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t2686~0.base_10| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t2686~0.base_10|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2686~0.base_10| 4)) (= |v_#memory_int_167| (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t2686~0.base_10| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t2686~0.base_10|) |v_ULTIMATE.start_main_~#t2686~0.offset_9| 2))) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2686~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2686~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_168|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t2686~0.base=|v_ULTIMATE.start_main_~#t2686~0.base_10|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_167|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2686~0.offset=|v_ULTIMATE.start_main_~#t2686~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2686~0.base, ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2686~0.offset] because there is no mapped edge [2019-12-27 00:20:22,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L799-->L799-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1140726772 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite33_In-1140726772| |P2Thread1of1ForFork2_#t~ite33_Out-1140726772|) (= |P2Thread1of1ForFork2_#t~ite34_Out-1140726772| ~y$w_buff1~0_In-1140726772)) (and (= ~y$w_buff1~0_In-1140726772 |P2Thread1of1ForFork2_#t~ite33_Out-1140726772|) (= |P2Thread1of1ForFork2_#t~ite34_Out-1140726772| |P2Thread1of1ForFork2_#t~ite33_Out-1140726772|) .cse0 (= 0 (mod ~y$w_buff0_used~0_In-1140726772 256))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1140726772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140726772, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_In-1140726772|, ~weak$$choice2~0=~weak$$choice2~0_In-1140726772} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-1140726772|, ~y$w_buff1~0=~y$w_buff1~0_In-1140726772, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140726772, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out-1140726772|, ~weak$$choice2~0=~weak$$choice2~0_In-1140726772} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34, P2Thread1of1ForFork2_#t~ite33] because there is no mapped edge [2019-12-27 00:20:22,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1148] [1148] L801-->L801-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1285585292 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out1285585292| |P2Thread1of1ForFork2_#t~ite44_Out1285585292|) .cse0 (= ~y$w_buff1_used~0_In1285585292 |P2Thread1of1ForFork2_#t~ite43_Out1285585292|) (= 0 (mod ~y$w_buff0_used~0_In1285585292 256))) (and (= ~y$w_buff1_used~0_In1285585292 |P2Thread1of1ForFork2_#t~ite44_Out1285585292|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite43_In1285585292| |P2Thread1of1ForFork2_#t~ite43_Out1285585292|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1285585292, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_In1285585292|, ~weak$$choice2~0=~weak$$choice2~0_In1285585292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285585292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1285585292, P2Thread1of1ForFork2_#t~ite44=|P2Thread1of1ForFork2_#t~ite44_Out1285585292|, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1285585292|, ~weak$$choice2~0=~weak$$choice2~0_In1285585292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1285585292} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite44, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 00:20:22,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_33 256))) (= v_~y$r_buff0_thd3~0_255 v_~y$r_buff0_thd3~0_254)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P2Thread1of1ForFork2_#t~ite46=|v_P2Thread1of1ForFork2_#t~ite46_15|, P2Thread1of1ForFork2_#t~ite45=|v_P2Thread1of1ForFork2_#t~ite45_14|, P2Thread1of1ForFork2_#t~ite48=|v_P2Thread1of1ForFork2_#t~ite48_11|, P2Thread1of1ForFork2_#t~ite47=|v_P2Thread1of1ForFork2_#t~ite47_14|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_33, P2Thread1of1ForFork2_#t~ite49=|v_P2Thread1of1ForFork2_#t~ite49_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite46, P2Thread1of1ForFork2_#t~ite45, P2Thread1of1ForFork2_#t~ite48, P2Thread1of1ForFork2_#t~ite47, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite49] because there is no mapped edge [2019-12-27 00:20:22,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L807-->L814: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= |v_#memory_int_99| (store |v_#memory_int_100| |v_~#y~0.base_59| (store (select |v_#memory_int_100| |v_~#y~0.base_59|) |v_~#y~0.offset_59| v_~y$mem_tmp~0_7))) (= v_~z~0_10 1) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, #memory_int=|v_#memory_int_100|, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~#y~0.base=|v_~#y~0.base_59|} OutVars{P2Thread1of1ForFork2_#t~ite58=|v_P2Thread1of1ForFork2_#t~ite58_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, P2Thread1of1ForFork2_#t~mem57=|v_P2Thread1of1ForFork2_#t~mem57_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, #memory_int=|v_#memory_int_99|, ~z~0=v_~z~0_10, ~#y~0.base=|v_~#y~0.base_59|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58, P2Thread1of1ForFork2_#t~mem57, ~y$flush_delayed~0, #memory_int, ~z~0] because there is no mapped edge [2019-12-27 00:20:22,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_7|) (= |v_P0Thread1of1ForFork0_#res.offset_7| 0) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_~z~0_16 v_~__unbuffered_p0_EAX~0_21) (= 1 v_~x~0_275)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~z~0=v_~z~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~z~0=v_~z~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_275, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 00:20:22,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L814-2-->L814-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite61_Out1042057969| |P2Thread1of1ForFork2_#t~ite60_Out1042057969|)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1042057969 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1042057969 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~mem59_Out1042057969| |P2Thread1of1ForFork2_#t~ite60_Out1042057969|) (or .cse1 .cse2) (= (select (select |#memory_int_In1042057969| |~#y~0.base_In1042057969|) |~#y~0.offset_In1042057969|) |P2Thread1of1ForFork2_#t~mem59_Out1042057969|)) (and .cse0 (not .cse1) (= |P2Thread1of1ForFork2_#t~mem59_In1042057969| |P2Thread1of1ForFork2_#t~mem59_Out1042057969|) (not .cse2) (= ~y$w_buff1~0_In1042057969 |P2Thread1of1ForFork2_#t~ite60_Out1042057969|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1042057969, ~#y~0.offset=|~#y~0.offset_In1042057969|, ~y$w_buff1~0=~y$w_buff1~0_In1042057969, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_In1042057969|, #memory_int=|#memory_int_In1042057969|, ~#y~0.base=|~#y~0.base_In1042057969|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042057969} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1042057969, ~#y~0.offset=|~#y~0.offset_In1042057969|, ~y$w_buff1~0=~y$w_buff1~0_In1042057969, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_Out1042057969|, P2Thread1of1ForFork2_#t~ite61=|P2Thread1of1ForFork2_#t~ite61_Out1042057969|, #memory_int=|#memory_int_In1042057969|, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out1042057969|, ~#y~0.base=|~#y~0.base_In1042057969|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1042057969} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~mem59, P2Thread1of1ForFork2_#t~ite61, P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-27 00:20:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1088] [1088] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1952569171 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1952569171 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite62_Out-1952569171| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite62_Out-1952569171| ~y$w_buff0_used~0_In-1952569171) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1952569171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1952569171} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1952569171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1952569171, P2Thread1of1ForFork2_#t~ite62=|P2Thread1of1ForFork2_#t~ite62_Out-1952569171|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite62] because there is no mapped edge [2019-12-27 00:20:22,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->L4-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_113 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_111| v_P1Thread1of1ForFork1_~arg.offset_111) (= v_P1Thread1of1ForFork1_~arg.base_111 |v_P1Thread1of1ForFork1_#in~arg.base_111|) (= v_~y$w_buff1~0_135 v_~y$w_buff0~0_238) (= 1 v_~y$w_buff0~0_237) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_233) (= v_~y$w_buff0_used~0_383 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111| 1) (= v_~__unbuffered_p1_EAX~0_111 v_~x~0_115) (= (mod v_~y$w_buff1_used~0_233 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$w_buff0~0=v_~y$w_buff0~0_238, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_113, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_111, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_111, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_111|, ~y$w_buff0~0=v_~y$w_buff0~0_237, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 00:20:22,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-448788362 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-448788362 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite6_Out-448788362| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-448788362 |P1Thread1of1ForFork1_#t~ite6_Out-448788362|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-448788362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-448788362} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-448788362, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-448788362, P1Thread1of1ForFork1_#t~ite6=|P1Thread1of1ForFork1_#t~ite6_Out-448788362|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 00:20:22,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1074] [1074] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In126155827 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In126155827 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In126155827 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In126155827 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite7_Out126155827| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite7_Out126155827| ~y$w_buff1_used~0_In126155827) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126155827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126155827, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126155827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126155827} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In126155827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In126155827, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In126155827, P1Thread1of1ForFork1_#t~ite7=|P1Thread1of1ForFork1_#t~ite7_Out126155827|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In126155827} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 00:20:22,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L781-->L782: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-55762873 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-55762873 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-55762873 ~y$r_buff0_thd2~0_In-55762873) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd2~0_Out-55762873 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-55762873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-55762873} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-55762873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-55762873, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-55762873|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 00:20:22,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In901179638 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In901179638 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In901179638 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In901179638 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite9_Out901179638| ~y$r_buff1_thd2~0_In901179638)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite9_Out901179638|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901179638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901179638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901179638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901179638} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901179638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901179638, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out901179638|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901179638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901179638} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 00:20:22,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork1_#t~ite9_24|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite9, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 00:20:22,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-264522438 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-264522438 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-264522438 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-264522438 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite63_Out-264522438| 0)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-264522438 |P2Thread1of1ForFork2_#t~ite63_Out-264522438|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-264522438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264522438, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-264522438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264522438} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-264522438, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264522438, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out-264522438|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-264522438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264522438} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63] because there is no mapped edge [2019-12-27 00:20:22,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2093244344 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2093244344 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite64_Out2093244344| 0)) (and (= |P2Thread1of1ForFork2_#t~ite64_Out2093244344| ~y$r_buff0_thd3~0_In2093244344) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2093244344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2093244344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2093244344, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2093244344, P2Thread1of1ForFork2_#t~ite64=|P2Thread1of1ForFork2_#t~ite64_Out2093244344|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite64] because there is no mapped edge [2019-12-27 00:20:22,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1119230602 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1119230602 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-1119230602 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1119230602 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite65_Out-1119230602| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite65_Out-1119230602| ~y$r_buff1_thd3~0_In-1119230602)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1119230602, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119230602, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1119230602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119230602} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1119230602, P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out-1119230602|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119230602, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1119230602, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119230602} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65] because there is no mapped edge [2019-12-27 00:20:22,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L818-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P2Thread1of1ForFork2_#t~ite65_22| v_~y$r_buff1_thd3~0_421) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_421, P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_21|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 00:20:22,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L845-->L847-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_10 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_79 256) 0) (= (mod v_~y$w_buff0_used~0_492 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 00:20:22,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L847-2-->L847-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In253307097 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In253307097 256)))) (or (and (= |ULTIMATE.start_main_#t~ite70_Out253307097| ~y$w_buff1~0_In253307097) (= |ULTIMATE.start_main_#t~mem69_In253307097| |ULTIMATE.start_main_#t~mem69_Out253307097|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~mem69_Out253307097| |ULTIMATE.start_main_#t~ite70_Out253307097|) (= (select (select |#memory_int_In253307097| |~#y~0.base_In253307097|) |~#y~0.offset_In253307097|) |ULTIMATE.start_main_#t~mem69_Out253307097|) (or .cse1 .cse0)))) InVars {~#y~0.offset=|~#y~0.offset_In253307097|, ~y$w_buff1~0=~y$w_buff1~0_In253307097, #memory_int=|#memory_int_In253307097|, ~#y~0.base=|~#y~0.base_In253307097|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In253307097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In253307097, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_In253307097|} OutVars{~#y~0.offset=|~#y~0.offset_In253307097|, ~y$w_buff1~0=~y$w_buff1~0_In253307097, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out253307097|, #memory_int=|#memory_int_In253307097|, ~#y~0.base=|~#y~0.base_In253307097|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In253307097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In253307097, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out253307097|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-27 00:20:22,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-4-->L848: Formula: (= (store |v_#memory_int_69| |v_~#y~0.base_37| (store (select |v_#memory_int_69| |v_~#y~0.base_37|) |v_~#y~0.offset_37| |v_ULTIMATE.start_main_#t~ite70_13|)) |v_#memory_int_68|) InVars {~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, #memory_int=|v_#memory_int_69|, ~#y~0.base=|v_~#y~0.base_37|} OutVars{ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_12|, #memory_int=|v_#memory_int_68|, ~#y~0.base=|v_~#y~0.base_37|, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-27 00:20:22,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-376995456 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-376995456 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite72_Out-376995456|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite72_Out-376995456| ~y$w_buff0_used~0_In-376995456) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-376995456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-376995456} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-376995456|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-376995456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-376995456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-27 00:20:22,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2145422807 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-2145422807 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-2145422807 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2145422807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite73_Out-2145422807| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite73_Out-2145422807| ~y$w_buff1_used~0_In-2145422807)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145422807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145422807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145422807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145422807} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-2145422807|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2145422807, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2145422807, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2145422807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2145422807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-27 00:20:22,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In429355826 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In429355826 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite74_Out429355826| 0)) (and (= |ULTIMATE.start_main_#t~ite74_Out429355826| ~y$r_buff0_thd0~0_In429355826) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In429355826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In429355826} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out429355826|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In429355826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In429355826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-27 00:20:22,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1639353394 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1639353394 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1639353394 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1639353394 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite75_Out1639353394| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite75_Out1639353394| ~y$r_buff1_thd0~0_In1639353394) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1639353394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1639353394, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1639353394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1639353394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1639353394, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1639353394, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1639353394, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out1639353394|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1639353394} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-27 00:20:22,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L855-->L855-3: Formula: (let ((.cse1 (not (= 0 (mod ~__unbuffered_p2_EAX$read_delayed~0_In-1296204078 256)))) (.cse0 (= (mod ~weak$$choice1~0_In-1296204078 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite78_Out-1296204078| ~__unbuffered_p2_EAX~0_In-1296204078) .cse1 (= |ULTIMATE.start_main_#t~mem77_In-1296204078| |ULTIMATE.start_main_#t~mem77_Out-1296204078|)) (and .cse1 (= |ULTIMATE.start_main_#t~mem77_Out-1296204078| (select (select |#memory_int_In-1296204078| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1296204078) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1296204078)) (= |ULTIMATE.start_main_#t~mem77_Out-1296204078| |ULTIMATE.start_main_#t~ite78_Out-1296204078|) (not .cse0)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1296204078, ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_In-1296204078|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1296204078, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1296204078, #memory_int=|#memory_int_In-1296204078|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-1296204078, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-1296204078} OutVars{ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_Out-1296204078|, ~weak$$choice1~0=~weak$$choice1~0_In-1296204078, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-1296204078, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-1296204078, #memory_int=|#memory_int_In-1296204078|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-1296204078, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-1296204078|, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-1296204078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-27 00:20:22,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L855-3-->L4: Formula: (and (let ((.cse1 (= 1 v_~__unbuffered_p0_EAX~0_26)) (.cse2 (= v_~__unbuffered_p1_EAX~0_540 1)) (.cse0 (= 1 v_~__unbuffered_p2_EAX~0_50))) (or (and (= v_~main$tmp_guard1~0_17 1) (or (not .cse0) (not .cse1) (not .cse2))) (and (= v_~main$tmp_guard1~0_17 0) .cse1 .cse2 .cse0))) (= |v_ULTIMATE.start_main_#t~ite78_30| v_~__unbuffered_p2_EAX~0_50) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_25|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_34|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite78, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 00:20:22,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 00:20:22,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:20:22 BasicIcfg [2019-12-27 00:20:22,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:20:22,403 INFO L168 Benchmark]: Toolchain (without parser) took 43963.08 ms. Allocated memory was 145.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 101.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 832.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,404 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:20:22,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.08 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 153.2 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,408 INFO L168 Benchmark]: Boogie Preprocessor took 57.42 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,408 INFO L168 Benchmark]: RCFGBuilder took 1021.67 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 148.3 MB in the beginning and 201.8 MB in the end (delta: -53.5 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,409 INFO L168 Benchmark]: TraceAbstraction took 42117.17 ms. Allocated memory was 237.0 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 201.8 MB in the beginning and 1.1 GB in the end (delta: -926.1 MB). Peak memory consumption was 842.3 MB. Max. memory is 7.1 GB. [2019-12-27 00:20:22,416 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.18 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.08 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.2 MB in the beginning and 153.2 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.42 ms. Allocated memory is still 203.4 MB. Free memory was 151.2 MB in the beginning and 148.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1021.67 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 148.3 MB in the beginning and 201.8 MB in the end (delta: -53.5 MB). Peak memory consumption was 64.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42117.17 ms. Allocated memory was 237.0 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 201.8 MB in the beginning and 1.1 GB in the end (delta: -926.1 MB). Peak memory consumption was 842.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 10.0s, 224 ProgramPointsBefore, 107 ProgramPointsAfterwards, 276 TransitionsBefore, 133 TransitionsAfterwards, 22870 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 66 ConcurrentYvCompositions, 30 ChoiceCompositions, 10335 VarBasedMoverChecksPositive, 480 VarBasedMoverChecksNegative, 246 SemBasedMoverChecksPositive, 398 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.8s, 0 MoverChecksTotal, 113419 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t2684, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L839] FCALL, FORK 0 pthread_create(&t2685, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L841] FCALL, FORK 0 pthread_create(&t2686, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] EXPR 3 \read(y) [L795] 3 y$mem_tmp = y [L796] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L797] EXPR 3 \read(y) [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) VAL [!y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={5:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L797] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))))=0, x=0, y={5:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))=0, x=0, y={5:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={5:0}, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L804] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L805] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L806] EXPR 3 \read(y) [L806] 3 __unbuffered_p2_EAX = y [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=1] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L771] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 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 [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={5: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L848] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L849] 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 [L850] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L851] 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 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2657 SDtfs, 3968 SDslu, 5771 SDs, 0 SdLazy, 3626 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57838occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 53457 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 112471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...