/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:23:31,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:23:31,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:23:31,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:23:31,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:23:31,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:23:31,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:23:31,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:23:31,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:23:31,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:23:31,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:23:31,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:23:31,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:23:31,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:23:31,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:23:31,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:23:31,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:23:31,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:23:31,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:23:31,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:23:31,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:23:31,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:23:31,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:23:31,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:23:31,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:23:31,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:23:31,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:23:31,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:23:31,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:23:31,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:23:31,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:23:31,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:23:31,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:23:31,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:23:31,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:23:31,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:23:31,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:23:31,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:23:31,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:23:31,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:23:31,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:23:31,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:23:31,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:23:31,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:23:31,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:23:31,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:23:31,122 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:23:31,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:23:31,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:23:31,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:23:31,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:23:31,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:23:31,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:23:31,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:23:31,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:23:31,125 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:23:31,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:23:31,125 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:23:31,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:23:31,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:23:31,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:23:31,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:23:31,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:23:31,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:23:31,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:23:31,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:23:31,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:23:31,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:23:31,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:23:31,128 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:23:31,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:23:31,129 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:23:31,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:23:31,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:23:31,454 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:23:31,455 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:23:31,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:23:31,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-27 05:23:31,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07cd206f/0582dfc2ebae4ee7a563bfcbefea7dbb/FLAG1d5f4d367 [2019-12-27 05:23:32,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:23:32,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-27 05:23:32,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07cd206f/0582dfc2ebae4ee7a563bfcbefea7dbb/FLAG1d5f4d367 [2019-12-27 05:23:32,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a07cd206f/0582dfc2ebae4ee7a563bfcbefea7dbb [2019-12-27 05:23:32,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:23:32,386 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:23:32,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:23:32,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:23:32,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:23:32,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:32" (1/1) ... [2019-12-27 05:23:32,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:32, skipping insertion in model container [2019-12-27 05:23:32,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:32" (1/1) ... [2019-12-27 05:23:32,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:23:32,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:23:33,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:23:33,085 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:23:33,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:23:33,225 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:23:33,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33 WrapperNode [2019-12-27 05:23:33,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:23:33,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:23:33,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:23:33,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:23:33,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:23:33,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:23:33,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:23:33,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:23:33,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (1/1) ... [2019-12-27 05:23:33,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:23:33,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:23:33,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:23:33,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:23:33,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (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 05:23:33,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:23:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:23:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:23:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:23:33,435 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:23:33,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:23:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:23:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:23:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:23:33,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:23:33,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:23:33,439 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 05:23:34,167 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:23:34,167 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:23:34,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:34 BoogieIcfgContainer [2019-12-27 05:23:34,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:23:34,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:23:34,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:23:34,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:23:34,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:23:32" (1/3) ... [2019-12-27 05:23:34,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:34, skipping insertion in model container [2019-12-27 05:23:34,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:33" (2/3) ... [2019-12-27 05:23:34,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4adb4cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:34, skipping insertion in model container [2019-12-27 05:23:34,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:34" (3/3) ... [2019-12-27 05:23:34,181 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-12-27 05:23:34,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:23:34,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:23:34,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:23:34,203 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:23:34,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,245 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,246 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,247 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,256 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:23:34,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:23:34,366 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:23:34,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:23:34,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:23:34,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:23:34,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:23:34,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:23:34,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:23:34,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:23:34,386 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 05:23:34,388 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 05:23:34,504 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 05:23:34,504 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:23:34,518 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:23:34,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 05:23:34,583 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 05:23:34,583 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:23:34,589 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:23:34,603 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:23:34,604 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:23:37,950 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 05:23:38,067 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 05:23:38,090 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 05:23:38,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 05:23:38,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 05:23:38,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 05:23:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 05:23:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:23:38,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:38,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:23:38,557 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 05:23:38,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:38,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190200558] [2019-12-27 05:23:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:38,776 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 05:23:38,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190200558] [2019-12-27 05:23:38,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:38,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:38,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77600907] [2019-12-27 05:23:38,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:38,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:38,803 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 05:23:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:39,048 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 05:23:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:39,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:23:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:39,126 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 05:23:39,127 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 05:23:39,128 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 05:23:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 05:23:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 05:23:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 05:23:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 05:23:39,566 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 05:23:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:39,566 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 05:23:39,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 05:23:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:23:39,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:39,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:39,570 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:39,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 05:23:39,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:39,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018952065] [2019-12-27 05:23:39,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:39,639 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 05:23:39,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018952065] [2019-12-27 05:23:39,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:39,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:39,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833767052] [2019-12-27 05:23:39,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:39,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:39,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:39,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:39,643 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 05:23:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:39,672 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 05:23:39,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:39,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 05:23:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:39,679 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 05:23:39,680 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 05:23:39,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:23:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 05:23:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 05:23:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 05:23:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 05:23:39,716 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 05:23:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:39,717 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 05:23:39,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 05:23:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:23:39,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:39,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:23:39,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:39,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:39,719 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 05:23:39,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:39,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729993922] [2019-12-27 05:23:39,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:39,850 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 05:23:39,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729993922] [2019-12-27 05:23:39,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:39,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:39,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926899511] [2019-12-27 05:23:39,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:39,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:39,855 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 05:23:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:40,125 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 05:23:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:23:40,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 05:23:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:40,136 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 05:23:40,137 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 05:23:40,137 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 05:23:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 05:23:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 05:23:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 05:23:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 05:23:40,180 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 05:23:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:40,181 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 05:23:40,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 05:23:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:23:40,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:40,184 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] [2019-12-27 05:23:40,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 05:23:40,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:40,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145994019] [2019-12-27 05:23:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:40,315 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 05:23:40,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145994019] [2019-12-27 05:23:40,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:40,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:23:40,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904842205] [2019-12-27 05:23:40,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:23:40,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:40,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:23:40,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:23:40,317 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-27 05:23:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:40,697 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-27 05:23:40,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:23:40,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:23:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:40,712 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 05:23:40,713 INFO L226 Difference]: Without dead ends: 2335 [2019-12-27 05:23:40,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:23:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-27 05:23:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-27 05:23:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 05:23:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 05:23:40,757 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 05:23:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:40,758 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 05:23:40,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:23:40,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 05:23:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:23:40,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:40,760 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] [2019-12-27 05:23:40,761 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:40,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:40,761 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 05:23:40,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:40,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862965158] [2019-12-27 05:23:40,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:40,901 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 05:23:40,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862965158] [2019-12-27 05:23:40,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:40,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:23:40,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151324981] [2019-12-27 05:23:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:40,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:40,903 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 05:23:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:40,914 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 05:23:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:40,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 05:23:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:40,924 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 05:23:40,924 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 05:23:40,925 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 05:23:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 05:23:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 05:23:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 05:23:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 05:23:40,961 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 05:23:40,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:40,962 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 05:23:40,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:40,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 05:23:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:23:40,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:40,964 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 05:23:40,965 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 05:23:40,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:40,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279829575] [2019-12-27 05:23:40,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:41,044 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 05:23:41,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279829575] [2019-12-27 05:23:41,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:41,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:41,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599423166] [2019-12-27 05:23:41,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:41,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:41,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:41,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:41,047 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 05:23:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:41,073 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 05:23:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:23:41,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 05:23:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:41,080 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 05:23:41,080 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 05:23:41,081 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 05:23:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 05:23:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 05:23:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 05:23:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 05:23:41,106 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 05:23:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:41,107 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 05:23:41,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:41,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 05:23:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:23:41,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:41,109 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 05:23:41,109 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 05:23:41,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:41,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049688605] [2019-12-27 05:23:41,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:41,184 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 05:23:41,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049688605] [2019-12-27 05:23:41,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:41,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:23:41,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840810290] [2019-12-27 05:23:41,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:23:41,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:41,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:23:41,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:23:41,188 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 5 states. [2019-12-27 05:23:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:41,668 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 05:23:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:23:41,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:23:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:41,678 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 05:23:41,678 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 05:23:41,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:23:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 05:23:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 05:23:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 05:23:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 05:23:41,717 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 05:23:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:41,717 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 05:23:41,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:23:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 05:23:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:23:41,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:41,720 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 05:23:41,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:41,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:41,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 05:23:41,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:41,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415961099] [2019-12-27 05:23:41,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:41,767 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 05:23:41,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415961099] [2019-12-27 05:23:41,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:41,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:41,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918205948] [2019-12-27 05:23:41,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:23:41,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:23:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:41,771 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 4 states. [2019-12-27 05:23:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:41,785 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 05:23:41,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:23:41,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 05:23:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:41,791 INFO L225 Difference]: With dead ends: 921 [2019-12-27 05:23:41,791 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 05:23:41,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:23:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 05:23:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 05:23:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 05:23:41,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 05:23:41,825 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 05:23:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:41,826 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 05:23:41,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:23:41,826 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 05:23:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:41,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:41,830 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] [2019-12-27 05:23:41,830 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 05:23:41,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:41,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154325123] [2019-12-27 05:23:41,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:41,929 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 05:23:41,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154325123] [2019-12-27 05:23:41,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:41,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:23:41,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216222228] [2019-12-27 05:23:41,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:23:41,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:23:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:41,932 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-27 05:23:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:42,175 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 05:23:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:23:42,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 05:23:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:42,179 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 05:23:42,179 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 05:23:42,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:23:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 05:23:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 05:23:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 05:23:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 05:23:42,201 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 05:23:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:42,202 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 05:23:42,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:23:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 05:23:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:42,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:42,207 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] [2019-12-27 05:23:42,208 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 05:23:42,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:42,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831503608] [2019-12-27 05:23:42,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:23:42,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831503608] [2019-12-27 05:23:42,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:42,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:23:42,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762442013] [2019-12-27 05:23:42,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:23:42,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:23:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:23:42,374 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-27 05:23:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:42,930 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-27 05:23:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:23:42,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 05:23:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:42,933 INFO L225 Difference]: With dead ends: 1033 [2019-12-27 05:23:42,933 INFO L226 Difference]: Without dead ends: 1033 [2019-12-27 05:23:42,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:23:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-12-27 05:23:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 833. [2019-12-27 05:23:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-12-27 05:23:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1740 transitions. [2019-12-27 05:23:42,950 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1740 transitions. Word has length 51 [2019-12-27 05:23:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:42,950 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1740 transitions. [2019-12-27 05:23:42,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:23:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1740 transitions. [2019-12-27 05:23:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:23:42,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:42,953 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] [2019-12-27 05:23:42,953 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 05:23:42,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:42,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373598601] [2019-12-27 05:23:42,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:43,023 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 05:23:43,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373598601] [2019-12-27 05:23:43,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:43,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:43,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883773230] [2019-12-27 05:23:43,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:43,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:43,025 INFO L87 Difference]: Start difference. First operand 833 states and 1740 transitions. Second operand 3 states. [2019-12-27 05:23:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:43,081 INFO L93 Difference]: Finished difference Result 1106 states and 2316 transitions. [2019-12-27 05:23:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:43,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:23:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:43,085 INFO L225 Difference]: With dead ends: 1106 [2019-12-27 05:23:43,085 INFO L226 Difference]: Without dead ends: 1106 [2019-12-27 05:23:43,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 05:23:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-12-27 05:23:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 890. [2019-12-27 05:23:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 05:23:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1876 transitions. [2019-12-27 05:23:43,103 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1876 transitions. Word has length 51 [2019-12-27 05:23:43,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:43,104 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1876 transitions. [2019-12-27 05:23:43,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:43,104 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1876 transitions. [2019-12-27 05:23:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:23:43,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:43,107 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] [2019-12-27 05:23:43,107 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 05:23:43,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:43,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909142905] [2019-12-27 05:23:43,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:43,236 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 05:23:43,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909142905] [2019-12-27 05:23:43,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:43,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:23:43,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32932858] [2019-12-27 05:23:43,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:23:43,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:23:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:23:43,238 INFO L87 Difference]: Start difference. First operand 890 states and 1876 transitions. Second operand 8 states. [2019-12-27 05:23:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:43,979 INFO L93 Difference]: Finished difference Result 1144 states and 2352 transitions. [2019-12-27 05:23:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:23:43,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 05:23:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:43,983 INFO L225 Difference]: With dead ends: 1144 [2019-12-27 05:23:43,983 INFO L226 Difference]: Without dead ends: 1144 [2019-12-27 05:23:43,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:23:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-27 05:23:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 950. [2019-12-27 05:23:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 05:23:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1998 transitions. [2019-12-27 05:23:44,002 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1998 transitions. Word has length 52 [2019-12-27 05:23:44,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:44,002 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1998 transitions. [2019-12-27 05:23:44,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:23:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1998 transitions. [2019-12-27 05:23:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:23:44,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:44,005 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] [2019-12-27 05:23:44,005 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-27 05:23:44,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:44,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227064444] [2019-12-27 05:23:44,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:44,055 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 05:23:44,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227064444] [2019-12-27 05:23:44,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:44,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:23:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056966016] [2019-12-27 05:23:44,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:44,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:44,058 INFO L87 Difference]: Start difference. First operand 950 states and 1998 transitions. Second operand 3 states. [2019-12-27 05:23:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:44,110 INFO L93 Difference]: Finished difference Result 1359 states and 2744 transitions. [2019-12-27 05:23:44,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:44,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:23:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:44,113 INFO L225 Difference]: With dead ends: 1359 [2019-12-27 05:23:44,113 INFO L226 Difference]: Without dead ends: 1359 [2019-12-27 05:23:44,114 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 05:23:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2019-12-27 05:23:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1036. [2019-12-27 05:23:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-12-27 05:23:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2149 transitions. [2019-12-27 05:23:44,134 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2149 transitions. Word has length 52 [2019-12-27 05:23:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:44,134 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 2149 transitions. [2019-12-27 05:23:44,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2149 transitions. [2019-12-27 05:23:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:23:44,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:44,137 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] [2019-12-27 05:23:44,137 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-27 05:23:44,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:44,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76009] [2019-12-27 05:23:44,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:23:44,203 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 05:23:44,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76009] [2019-12-27 05:23:44,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:23:44,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:23:44,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840908096] [2019-12-27 05:23:44,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:23:44,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:23:44,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:23:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:23:44,205 INFO L87 Difference]: Start difference. First operand 1036 states and 2149 transitions. Second operand 3 states. [2019-12-27 05:23:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:23:44,217 INFO L93 Difference]: Finished difference Result 1035 states and 2147 transitions. [2019-12-27 05:23:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:23:44,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:23:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:23:44,220 INFO L225 Difference]: With dead ends: 1035 [2019-12-27 05:23:44,220 INFO L226 Difference]: Without dead ends: 1035 [2019-12-27 05:23:44,221 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 05:23:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-27 05:23:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 823. [2019-12-27 05:23:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 05:23:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-27 05:23:44,237 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-27 05:23:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:23:44,237 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-27 05:23:44,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:23:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-27 05:23:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:23:44,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:23:44,239 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] [2019-12-27 05:23:44,240 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:23:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:23:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 05:23:44,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:23:44,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366746335] [2019-12-27 05:23:44,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:23:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:23:44,417 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:23:44,417 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:23:44,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t305~0.base_22|) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~weak$$choice2~0_34) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t305~0.base_22| 1)) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t305~0.base_22| 4)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t305~0.base_22|) |v_ULTIMATE.start_main_~#t305~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~weak$$choice0~0_6) (= 0 |v_ULTIMATE.start_main_~#t305~0.offset_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t305~0.base_22|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t305~0.offset=|v_ULTIMATE.start_main_~#t305~0.offset_17|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_~#t305~0.base=|v_ULTIMATE.start_main_~#t305~0.base_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t305~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t305~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t306~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t306~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:23:44,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t306~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t306~0.base_10|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t306~0.base_10| 1) |v_#valid_19|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t306~0.base_10|) |v_ULTIMATE.start_main_~#t306~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t306~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t306~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t306~0.base=|v_ULTIMATE.start_main_~#t306~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t306~0.offset=|v_ULTIMATE.start_main_~#t306~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t306~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t306~0.offset] because there is no mapped edge [2019-12-27 05:23:44,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-2054885686) (= ~y$r_buff1_thd0~0_Out-2054885686 ~y$r_buff0_thd0~0_In-2054885686) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2054885686)) (= ~y$r_buff0_thd1~0_In-2054885686 ~y$r_buff1_thd1~0_Out-2054885686) (= ~x~0_In-2054885686 ~__unbuffered_p0_EAX~0_Out-2054885686) (= ~y$r_buff1_thd2~0_Out-2054885686 ~y$r_buff0_thd2~0_In-2054885686)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2054885686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2054885686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054885686, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2054885686, ~x~0=~x~0_In-2054885686} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2054885686, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2054885686, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2054885686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2054885686, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2054885686, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054885686, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-2054885686, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2054885686, ~x~0=~x~0_In-2054885686} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:23:44,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1801789108 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1801789108 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1801789108| ~y$w_buff0_used~0_In-1801789108) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1801789108| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1801789108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1801789108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1801789108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1801789108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1801789108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:23:44,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In567332192 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In567332192 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In567332192 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In567332192 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out567332192| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out567332192| ~y$w_buff1_used~0_In567332192) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In567332192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In567332192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In567332192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In567332192} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out567332192|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In567332192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In567332192, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In567332192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In567332192} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:23:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-914629763 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-914629763 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-914629763 ~y$r_buff0_thd1~0_In-914629763)) (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-914629763 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-914629763, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-914629763} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-914629763, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-914629763|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-914629763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:23:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In816929958 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In816929958 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In816929958 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In816929958 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In816929958 |P0Thread1of1ForFork0_#t~ite8_Out816929958|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out816929958|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In816929958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In816929958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816929958, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out816929958|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In816929958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816929958} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:23:44,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:23:44,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-835799024 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-835799024| ~y$w_buff1~0_In-835799024) (= |P1Thread1of1ForFork1_#t~ite17_In-835799024| |P1Thread1of1ForFork1_#t~ite17_Out-835799024|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-835799024 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-835799024 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-835799024 256))) (= 0 (mod ~y$w_buff0_used~0_In-835799024 256)))) (= ~y$w_buff1~0_In-835799024 |P1Thread1of1ForFork1_#t~ite17_Out-835799024|) .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out-835799024| |P1Thread1of1ForFork1_#t~ite17_Out-835799024|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-835799024, ~y$w_buff1~0=~y$w_buff1~0_In-835799024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-835799024, ~weak$$choice2~0=~weak$$choice2~0_In-835799024, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-835799024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-835799024, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-835799024|, ~y$w_buff1~0=~y$w_buff1~0_In-835799024, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-835799024, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-835799024, ~weak$$choice2~0=~weak$$choice2~0_In-835799024, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-835799024|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-835799024} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 05:23:44,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1643471460 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1643471460| |P1Thread1of1ForFork1_#t~ite21_Out-1643471460|) (= |P1Thread1of1ForFork1_#t~ite20_Out-1643471460| ~y$w_buff0_used~0_In-1643471460) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1643471460 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1643471460 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1643471460 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1643471460 256) 0))))) (and (= ~y$w_buff0_used~0_In-1643471460 |P1Thread1of1ForFork1_#t~ite21_Out-1643471460|) (= |P1Thread1of1ForFork1_#t~ite20_In-1643471460| |P1Thread1of1ForFork1_#t~ite20_Out-1643471460|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1643471460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1643471460|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460, ~weak$$choice2~0=~weak$$choice2~0_In-1643471460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1643471460} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1643471460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1643471460, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1643471460|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1643471460, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1643471460|, ~weak$$choice2~0=~weak$$choice2~0_In-1643471460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1643471460} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:23:44,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse4 (= (mod ~y$w_buff1_used~0_In-1437709424 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1437709424| |P1Thread1of1ForFork1_#t~ite23_Out-1437709424|)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1437709424 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1437709424 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In-1437709424 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1437709424 256)))) (or (and (or (and (not .cse0) (= ~y$w_buff1_used~0_In-1437709424 |P1Thread1of1ForFork1_#t~ite24_Out-1437709424|) (= |P1Thread1of1ForFork1_#t~ite23_In-1437709424| |P1Thread1of1ForFork1_#t~ite23_Out-1437709424|)) (and (= ~y$w_buff1_used~0_In-1437709424 |P1Thread1of1ForFork1_#t~ite23_Out-1437709424|) .cse1 (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5) .cse0)) (= |P1Thread1of1ForFork1_#t~ite22_In-1437709424| |P1Thread1of1ForFork1_#t~ite22_Out-1437709424|)) (let ((.cse6 (not .cse2))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-1437709424| |P1Thread1of1ForFork1_#t~ite23_Out-1437709424|) (or (not .cse4) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-1437709424| 0) .cse1 .cse0 (or .cse6 (not .cse3)) (not .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1437709424|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1437709424|, ~weak$$choice2~0=~weak$$choice2~0_In-1437709424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1437709424, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1437709424, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1437709424, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1437709424|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1437709424|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1437709424|, ~weak$$choice2~0=~weak$$choice2~0_In-1437709424, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1437709424} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 05:23:44,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:23:44,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1447285907 256) 0))) (or (and (not .cse0) (= ~y$r_buff1_thd2~0_In1447285907 |P1Thread1of1ForFork1_#t~ite30_Out1447285907|) (= |P1Thread1of1ForFork1_#t~ite29_In1447285907| |P1Thread1of1ForFork1_#t~ite29_Out1447285907|) (= |P1Thread1of1ForFork1_#t~ite28_In1447285907| |P1Thread1of1ForFork1_#t~ite28_Out1447285907|)) (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In1447285907 256) 0)))) (and (or (not (= (mod ~y$r_buff1_thd2~0_In1447285907 256) 0)) .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out1447285907| |P1Thread1of1ForFork1_#t~ite29_Out1447285907|) (= |P1Thread1of1ForFork1_#t~ite28_Out1447285907| |P1Thread1of1ForFork1_#t~ite29_Out1447285907|) .cse0 (= |P1Thread1of1ForFork1_#t~ite28_Out1447285907| 0) (or .cse1 (not (= 0 (mod ~y$w_buff1_used~0_In1447285907 256)))) (not (= (mod ~y$w_buff0_used~0_In1447285907 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1447285907, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1447285907|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1447285907, ~weak$$choice2~0=~weak$$choice2~0_In1447285907, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1447285907|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1447285907, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1447285907|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1447285907|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1447285907, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1447285907, ~weak$$choice2~0=~weak$$choice2~0_In1447285907, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1447285907|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1447285907} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 05:23:44,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 05:23:44,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-400850850| |P1Thread1of1ForFork1_#t~ite33_Out-400850850|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-400850850 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-400850850 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-400850850| ~y$w_buff1~0_In-400850850) .cse2) (and .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out-400850850| ~y~0_In-400850850) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-400850850, ~y$w_buff1~0=~y$w_buff1~0_In-400850850, ~y~0=~y~0_In-400850850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-400850850} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-400850850, ~y$w_buff1~0=~y$w_buff1~0_In-400850850, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-400850850|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-400850850|, ~y~0=~y~0_In-400850850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-400850850} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 05:23:44,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In831481701 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In831481701 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out831481701| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out831481701| ~y$w_buff0_used~0_In831481701)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In831481701} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In831481701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In831481701, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out831481701|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:23:44,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In93276638 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In93276638 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In93276638 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In93276638 256) 0))) (or (and (= ~y$w_buff1_used~0_In93276638 |P1Thread1of1ForFork1_#t~ite35_Out93276638|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out93276638|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In93276638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In93276638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In93276638} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In93276638, ~y$w_buff0_used~0=~y$w_buff0_used~0_In93276638, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In93276638, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out93276638|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In93276638} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:23:44,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In896364601 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In896364601 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out896364601| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In896364601 |P1Thread1of1ForFork1_#t~ite36_Out896364601|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In896364601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In896364601} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In896364601, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In896364601, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out896364601|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:23:44,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-477802941 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-477802941 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-477802941 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-477802941 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-477802941| ~y$r_buff1_thd2~0_In-477802941) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-477802941| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-477802941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-477802941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-477802941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477802941} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-477802941, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-477802941, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-477802941, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-477802941|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477802941} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:23:44,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:23:44,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:23:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-863454025 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-863454025 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-863454025| ~y~0_In-863454025) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-863454025| ~y$w_buff1~0_In-863454025)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-863454025, ~y~0=~y~0_In-863454025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-863454025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-863454025} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-863454025|, ~y$w_buff1~0=~y$w_buff1~0_In-863454025, ~y~0=~y~0_In-863454025, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-863454025, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-863454025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:23:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 05:23:44,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1366178130 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1366178130 256)))) (or (and (= ~y$w_buff0_used~0_In1366178130 |ULTIMATE.start_main_#t~ite42_Out1366178130|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out1366178130| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1366178130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1366178130} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1366178130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1366178130, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1366178130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:23:44,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1495408591 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1495408591 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1495408591 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1495408591 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1495408591| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1495408591| ~y$w_buff1_used~0_In1495408591)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1495408591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1495408591, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1495408591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1495408591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1495408591, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1495408591, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1495408591|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1495408591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1495408591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:23:44,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-687881970 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-687881970 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-687881970 |ULTIMATE.start_main_#t~ite44_Out-687881970|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-687881970|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-687881970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687881970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-687881970, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-687881970, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-687881970|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:23:44,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1808512592 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1808512592 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1808512592 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1808512592 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1808512592| ~y$r_buff1_thd0~0_In-1808512592) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1808512592| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1808512592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1808512592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808512592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808512592} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1808512592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1808512592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1808512592, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1808512592|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1808512592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:23:44,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:23:44,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:23:44 BasicIcfg [2019-12-27 05:23:44,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:23:44,521 INFO L168 Benchmark]: Toolchain (without parser) took 12135.41 ms. Allocated memory was 138.9 MB in the beginning and 378.0 MB in the end (delta: 239.1 MB). Free memory was 100.8 MB in the beginning and 158.9 MB in the end (delta: -58.1 MB). Peak memory consumption was 180.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,522 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.01 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.6 MB in the beginning and 158.7 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.20 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,524 INFO L168 Benchmark]: Boogie Preprocessor took 71.93 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,525 INFO L168 Benchmark]: RCFGBuilder took 800.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 108.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,525 INFO L168 Benchmark]: TraceAbstraction took 10349.12 ms. Allocated memory was 204.5 MB in the beginning and 378.0 MB in the end (delta: 173.5 MB). Free memory was 108.1 MB in the beginning and 158.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 122.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:23:44,531 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.16 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 840.01 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 100.6 MB in the beginning and 158.7 MB in the end (delta: -58.1 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.20 ms. Allocated memory is still 204.5 MB. Free memory was 158.0 MB in the beginning and 155.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.93 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 153.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 800.15 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 108.8 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10349.12 ms. Allocated memory was 204.5 MB in the beginning and 378.0 MB in the end (delta: 173.5 MB). Free memory was 108.1 MB in the beginning and 158.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 122.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1716 SDtfs, 1388 SDslu, 3232 SDs, 0 SdLazy, 2073 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2418 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 58720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...