/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/safe022_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:53:09,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:53:09,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:53:09,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:53:09,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:53:09,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:53:09,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:53:09,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:53:09,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:53:09,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:53:09,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:53:09,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:53:09,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:53:09,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:53:09,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:53:09,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:53:09,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:53:09,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:53:09,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:53:09,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:53:09,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:53:09,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:53:09,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:53:09,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:53:09,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:53:09,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:53:09,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:53:09,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:53:09,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:53:09,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:53:09,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:53:09,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:53:09,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:53:09,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:53:09,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:53:09,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:53:09,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:53:09,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:53:09,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:53:09,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:53:09,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:53:09,117 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 07:53:09,131 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:53:09,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:53:09,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:53:09,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:53:09,133 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:53:09,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:53:09,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:53:09,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:53:09,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:53:09,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:53:09,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:53:09,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:53:09,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:53:09,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:53:09,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:53:09,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:53:09,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:53:09,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:53:09,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:53:09,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:53:09,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:53:09,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:53:09,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:53:09,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:53:09,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:53:09,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:53:09,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:53:09,137 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:53:09,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:53:09,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:53:09,469 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:53:09,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:53:09,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:53:09,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:53:09,496 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:53:09,497 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc.i [2019-12-27 07:53:09,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a730aeead/35d96985f8f34631b75383d50d18da1a/FLAG78b89b242 [2019-12-27 07:53:10,137 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:53:10,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc.i [2019-12-27 07:53:10,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a730aeead/35d96985f8f34631b75383d50d18da1a/FLAG78b89b242 [2019-12-27 07:53:10,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a730aeead/35d96985f8f34631b75383d50d18da1a [2019-12-27 07:53:10,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:53:10,431 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:53:10,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:53:10,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:53:10,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:53:10,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:53:10" (1/1) ... [2019-12-27 07:53:10,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579e47a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:10, skipping insertion in model container [2019-12-27 07:53:10,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:53:10" (1/1) ... [2019-12-27 07:53:10,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:53:10,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:53:11,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:53:11,102 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:53:11,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:53:11,237 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:53:11,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11 WrapperNode [2019-12-27 07:53:11,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:53:11,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:53:11,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:53:11,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:53:11,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:53:11,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:53:11,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:53:11,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:53:11,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (1/1) ... [2019-12-27 07:53:11,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:53:11,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:53:11,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:53:11,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:53:11,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (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 07:53:11,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:53:11,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:53:11,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:53:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:53:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:53:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:53:11,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:53:11,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:53:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:53:11,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:53:11,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:53:11,408 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 07:53:12,123 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:53:12,123 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:53:12,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:53:12 BoogieIcfgContainer [2019-12-27 07:53:12,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:53:12,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:53:12,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:53:12,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:53:12,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:53:10" (1/3) ... [2019-12-27 07:53:12,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ded3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:53:12, skipping insertion in model container [2019-12-27 07:53:12,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:53:11" (2/3) ... [2019-12-27 07:53:12,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ded3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:53:12, skipping insertion in model container [2019-12-27 07:53:12,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:53:12" (3/3) ... [2019-12-27 07:53:12,134 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc.i [2019-12-27 07:53:12,144 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:53:12,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:53:12,153 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:53:12,154 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:53:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,215 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,249 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:53:12,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:53:12,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:53:12,323 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:53:12,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:53:12,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:53:12,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:53:12,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:53:12,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:53:12,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:53:12,346 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 07:53:12,348 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:53:12,462 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:53:12,462 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:53:12,477 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:53:12,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:53:12,581 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:53:12,581 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:53:12,591 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:53:12,609 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:53:12,610 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:53:16,075 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:53:16,185 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:53:16,214 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 07:53:16,214 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 07:53:16,217 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 07:53:16,671 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 07:53:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 07:53:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:53:16,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:16,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:53:16,681 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 07:53:16,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:16,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055088837] [2019-12-27 07:53:16,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:16,899 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 07:53:16,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055088837] [2019-12-27 07:53:16,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:16,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:53:16,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562210392] [2019-12-27 07:53:16,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:16,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:16,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:16,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:16,921 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 07:53:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:17,167 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 07:53:17,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:17,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:53:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:17,271 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 07:53:17,271 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 07:53:17,273 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 07:53:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 07:53:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 07:53:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 07:53:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 07:53:17,638 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 07:53:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 07:53:17,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 07:53:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:53:17,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:17,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:17,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 07:53:17,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:17,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519711893] [2019-12-27 07:53:17,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:17,799 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 07:53:17,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519711893] [2019-12-27 07:53:17,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:17,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:17,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122501129] [2019-12-27 07:53:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:17,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:17,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:17,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:17,802 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 07:53:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:18,211 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-27 07:53:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:53:18,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:53:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:18,284 INFO L225 Difference]: With dead ends: 11318 [2019-12-27 07:53:18,284 INFO L226 Difference]: Without dead ends: 11311 [2019-12-27 07:53:18,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 07:53:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-27 07:53:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-27 07:53:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-27 07:53:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-27 07:53:18,669 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-27 07:53:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:18,669 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-27 07:53:18,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-27 07:53:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:53:18,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:18,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:18,682 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 07:53:18,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:18,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639876852] [2019-12-27 07:53:18,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:18,840 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 07:53:18,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639876852] [2019-12-27 07:53:18,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:18,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:53:18,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789663986] [2019-12-27 07:53:18,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:53:18,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:53:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:18,843 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-27 07:53:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:19,330 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-27 07:53:19,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:53:19,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 07:53:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:19,377 INFO L225 Difference]: With dead ends: 14191 [2019-12-27 07:53:19,377 INFO L226 Difference]: Without dead ends: 14191 [2019-12-27 07:53:19,378 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 07:53:19,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-27 07:53:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-27 07:53:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-27 07:53:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-27 07:53:19,759 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-27 07:53:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:19,761 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-27 07:53:19,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:53:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-27 07:53:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:53:19,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:19,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:19,765 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:19,765 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-27 07:53:19,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:19,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468248263] [2019-12-27 07:53:19,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:19,823 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 07:53:19,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468248263] [2019-12-27 07:53:19,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:19,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:53:19,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264709940] [2019-12-27 07:53:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:19,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:19,828 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-27 07:53:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:20,034 INFO L93 Difference]: Finished difference Result 11055 states and 34705 transitions. [2019-12-27 07:53:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:20,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:53:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:20,070 INFO L225 Difference]: With dead ends: 11055 [2019-12-27 07:53:20,072 INFO L226 Difference]: Without dead ends: 11055 [2019-12-27 07:53:20,072 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 07:53:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-27 07:53:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 11055. [2019-12-27 07:53:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11055 states. [2019-12-27 07:53:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11055 states to 11055 states and 34705 transitions. [2019-12-27 07:53:20,360 INFO L78 Accepts]: Start accepts. Automaton has 11055 states and 34705 transitions. Word has length 16 [2019-12-27 07:53:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:20,360 INFO L462 AbstractCegarLoop]: Abstraction has 11055 states and 34705 transitions. [2019-12-27 07:53:20,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11055 states and 34705 transitions. [2019-12-27 07:53:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:53:20,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:20,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:20,365 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1227333524, now seen corresponding path program 1 times [2019-12-27 07:53:20,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:20,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335455673] [2019-12-27 07:53:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:53:20,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335455673] [2019-12-27 07:53:20,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:20,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:20,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760096369] [2019-12-27 07:53:20,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:20,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:20,426 INFO L87 Difference]: Start difference. First operand 11055 states and 34705 transitions. Second operand 4 states. [2019-12-27 07:53:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:20,538 INFO L93 Difference]: Finished difference Result 18070 states and 56990 transitions. [2019-12-27 07:53:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:53:20,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:53:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:20,561 INFO L225 Difference]: With dead ends: 18070 [2019-12-27 07:53:20,561 INFO L226 Difference]: Without dead ends: 8920 [2019-12-27 07:53:20,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 07:53:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2019-12-27 07:53:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8920. [2019-12-27 07:53:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8920 states. [2019-12-27 07:53:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8920 states to 8920 states and 27520 transitions. [2019-12-27 07:53:21,505 INFO L78 Accepts]: Start accepts. Automaton has 8920 states and 27520 transitions. Word has length 17 [2019-12-27 07:53:21,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:21,506 INFO L462 AbstractCegarLoop]: Abstraction has 8920 states and 27520 transitions. [2019-12-27 07:53:21,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8920 states and 27520 transitions. [2019-12-27 07:53:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 07:53:21,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:21,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:21,510 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -340030964, now seen corresponding path program 1 times [2019-12-27 07:53:21,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:21,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82056973] [2019-12-27 07:53:21,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:21,582 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 07:53:21,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82056973] [2019-12-27 07:53:21,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:21,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:21,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632140418] [2019-12-27 07:53:21,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:21,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:21,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:21,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:21,584 INFO L87 Difference]: Start difference. First operand 8920 states and 27520 transitions. Second operand 3 states. [2019-12-27 07:53:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:21,628 INFO L93 Difference]: Finished difference Result 8487 states and 25699 transitions. [2019-12-27 07:53:21,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:21,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 07:53:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:21,645 INFO L225 Difference]: With dead ends: 8487 [2019-12-27 07:53:21,646 INFO L226 Difference]: Without dead ends: 8487 [2019-12-27 07:53:21,646 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 07:53:21,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-12-27 07:53:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8487. [2019-12-27 07:53:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8487 states. [2019-12-27 07:53:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8487 states to 8487 states and 25699 transitions. [2019-12-27 07:53:21,847 INFO L78 Accepts]: Start accepts. Automaton has 8487 states and 25699 transitions. Word has length 18 [2019-12-27 07:53:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:21,848 INFO L462 AbstractCegarLoop]: Abstraction has 8487 states and 25699 transitions. [2019-12-27 07:53:21,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8487 states and 25699 transitions. [2019-12-27 07:53:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:53:21,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:21,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:21,852 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1311287021, now seen corresponding path program 1 times [2019-12-27 07:53:21,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:21,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41830713] [2019-12-27 07:53:21,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:21,925 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 07:53:21,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41830713] [2019-12-27 07:53:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:21,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:53:21,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291987255] [2019-12-27 07:53:21,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:53:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:53:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:53:21,928 INFO L87 Difference]: Start difference. First operand 8487 states and 25699 transitions. Second operand 4 states. [2019-12-27 07:53:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:21,957 INFO L93 Difference]: Finished difference Result 1553 states and 3753 transitions. [2019-12-27 07:53:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:53:21,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 07:53:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:21,960 INFO L225 Difference]: With dead ends: 1553 [2019-12-27 07:53:21,960 INFO L226 Difference]: Without dead ends: 1134 [2019-12-27 07:53:21,960 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 07:53:21,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2019-12-27 07:53:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2019-12-27 07:53:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-12-27 07:53:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2445 transitions. [2019-12-27 07:53:21,978 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2445 transitions. Word has length 19 [2019-12-27 07:53:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:21,979 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2445 transitions. [2019-12-27 07:53:21,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:53:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2445 transitions. [2019-12-27 07:53:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:53:21,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:21,981 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 07:53:21,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:21,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 07:53:21,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:21,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131786678] [2019-12-27 07:53:21,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:22,131 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 07:53:22,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131786678] [2019-12-27 07:53:22,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:22,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:53:22,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493679439] [2019-12-27 07:53:22,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:53:22,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:53:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:53:22,133 INFO L87 Difference]: Start difference. First operand 1134 states and 2445 transitions. Second operand 6 states. [2019-12-27 07:53:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:22,402 INFO L93 Difference]: Finished difference Result 1152 states and 2455 transitions. [2019-12-27 07:53:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:53:22,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 07:53:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:22,404 INFO L225 Difference]: With dead ends: 1152 [2019-12-27 07:53:22,404 INFO L226 Difference]: Without dead ends: 1099 [2019-12-27 07:53:22,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:53:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-12-27 07:53:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1078. [2019-12-27 07:53:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-12-27 07:53:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2326 transitions. [2019-12-27 07:53:22,420 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2326 transitions. Word has length 25 [2019-12-27 07:53:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:22,420 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 2326 transitions. [2019-12-27 07:53:22,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:53:22,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2326 transitions. [2019-12-27 07:53:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:53:22,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:22,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:53:22,423 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1580443706, now seen corresponding path program 1 times [2019-12-27 07:53:22,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:22,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261198650] [2019-12-27 07:53:22,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:22,507 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 07:53:22,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261198650] [2019-12-27 07:53:22,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:22,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:53:22,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640973668] [2019-12-27 07:53:22,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:53:22,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:22,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:53:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:22,509 INFO L87 Difference]: Start difference. First operand 1078 states and 2326 transitions. Second operand 5 states. [2019-12-27 07:53:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:22,547 INFO L93 Difference]: Finished difference Result 545 states and 1149 transitions. [2019-12-27 07:53:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:53:22,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 07:53:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:22,548 INFO L225 Difference]: With dead ends: 545 [2019-12-27 07:53:22,549 INFO L226 Difference]: Without dead ends: 460 [2019-12-27 07:53:22,549 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 07:53:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-27 07:53:22,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-12-27 07:53:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-12-27 07:53:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1003 transitions. [2019-12-27 07:53:22,556 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1003 transitions. Word has length 28 [2019-12-27 07:53:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:22,557 INFO L462 AbstractCegarLoop]: Abstraction has 460 states and 1003 transitions. [2019-12-27 07:53:22,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:53:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1003 transitions. [2019-12-27 07:53:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:53:22,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:22,559 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 07:53:22,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:22,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:22,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 1 times [2019-12-27 07:53:22,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:22,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718311751] [2019-12-27 07:53:22,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:22,697 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 07:53:22,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718311751] [2019-12-27 07:53:22,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:22,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:53:22,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968039670] [2019-12-27 07:53:22,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:53:22,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:53:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:53:22,699 INFO L87 Difference]: Start difference. First operand 460 states and 1003 transitions. Second operand 7 states. [2019-12-27 07:53:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:22,889 INFO L93 Difference]: Finished difference Result 962 states and 2027 transitions. [2019-12-27 07:53:22,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:53:22,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 07:53:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:22,891 INFO L225 Difference]: With dead ends: 962 [2019-12-27 07:53:22,891 INFO L226 Difference]: Without dead ends: 671 [2019-12-27 07:53:22,891 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 07:53:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-12-27 07:53:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 517. [2019-12-27 07:53:22,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-12-27 07:53:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1102 transitions. [2019-12-27 07:53:22,901 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1102 transitions. Word has length 52 [2019-12-27 07:53:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:22,901 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 1102 transitions. [2019-12-27 07:53:22,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:53:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1102 transitions. [2019-12-27 07:53:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:53:22,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:22,903 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 07:53:22,903 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 2 times [2019-12-27 07:53:22,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:22,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610931789] [2019-12-27 07:53:22,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:22,997 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 07:53:22,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610931789] [2019-12-27 07:53:22,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:22,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:53:22,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480013635] [2019-12-27 07:53:22,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:53:22,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:53:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:53:22,999 INFO L87 Difference]: Start difference. First operand 517 states and 1102 transitions. Second operand 5 states. [2019-12-27 07:53:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:23,373 INFO L93 Difference]: Finished difference Result 863 states and 1791 transitions. [2019-12-27 07:53:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:53:23,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 07:53:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:23,376 INFO L225 Difference]: With dead ends: 863 [2019-12-27 07:53:23,376 INFO L226 Difference]: Without dead ends: 839 [2019-12-27 07:53:23,377 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 07:53:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-12-27 07:53:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 691. [2019-12-27 07:53:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-27 07:53:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1477 transitions. [2019-12-27 07:53:23,389 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1477 transitions. Word has length 52 [2019-12-27 07:53:23,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:23,389 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1477 transitions. [2019-12-27 07:53:23,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:53:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1477 transitions. [2019-12-27 07:53:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:53:23,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:23,391 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 07:53:23,391 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 3 times [2019-12-27 07:53:23,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:23,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107519962] [2019-12-27 07:53:23,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:53:23,512 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 07:53:23,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107519962] [2019-12-27 07:53:23,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:53:23,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:53:23,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691352017] [2019-12-27 07:53:23,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:53:23,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:53:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:53:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:53:23,515 INFO L87 Difference]: Start difference. First operand 691 states and 1477 transitions. Second operand 3 states. [2019-12-27 07:53:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:53:23,582 INFO L93 Difference]: Finished difference Result 881 states and 1870 transitions. [2019-12-27 07:53:23,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:53:23,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:53:23,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:53:23,585 INFO L225 Difference]: With dead ends: 881 [2019-12-27 07:53:23,585 INFO L226 Difference]: Without dead ends: 881 [2019-12-27 07:53:23,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 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 07:53:23,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-12-27 07:53:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 718. [2019-12-27 07:53:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 07:53:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1539 transitions. [2019-12-27 07:53:23,602 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1539 transitions. Word has length 52 [2019-12-27 07:53:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:53:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1539 transitions. [2019-12-27 07:53:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:53:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1539 transitions. [2019-12-27 07:53:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:53:23,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:53:23,606 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 07:53:23,606 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:53:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:53:23,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 07:53:23,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:53:23,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150973134] [2019-12-27 07:53:23,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:53:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:53:23,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:53:23,801 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:53:23,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2305~0.base_24|) 0) (= 0 v_~y$mem_tmp~0_9) (= (store .cse0 |v_ULTIMATE.start_main_~#t2305~0.base_24| 1) |v_#valid_49|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2305~0.base_24|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2305~0.base_24| 4) |v_#length_17|) (= 0 v_~y$r_buff1_thd1~0_21) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2305~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2305~0.base_24|) |v_ULTIMATE.start_main_~#t2305~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= |v_ULTIMATE.start_main_~#t2305~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2306~0.offset=|v_ULTIMATE.start_main_~#t2306~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~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_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t2305~0.base=|v_ULTIMATE.start_main_~#t2305~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ULTIMATE.start_main_~#t2306~0.base=|v_ULTIMATE.start_main_~#t2306~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t2305~0.offset=|v_ULTIMATE.start_main_~#t2305~0.offset_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2306~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_#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_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2305~0.base, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t2306~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2305~0.offset, 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 07:53:23,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2306~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2306~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2306~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2306~0.base_13|) |v_ULTIMATE.start_main_~#t2306~0.offset_11| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2306~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2306~0.base_13| 4) |v_#length_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2306~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2306~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2306~0.base=|v_ULTIMATE.start_main_~#t2306~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2306~0.offset=|v_ULTIMATE.start_main_~#t2306~0.offset_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2306~0.base, ULTIMATE.start_main_~#t2306~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:53:23,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-850675976) (= 1 ~x~0_Out-850675976) (= ~y$r_buff1_thd0~0_Out-850675976 ~y$r_buff0_thd0~0_In-850675976) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-850675976)) (= ~y$r_buff1_thd1~0_Out-850675976 ~y$r_buff0_thd1~0_In-850675976) (= ~y$r_buff1_thd2~0_Out-850675976 ~y$r_buff0_thd2~0_In-850675976)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-850675976, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-850675976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-850675976, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-850675976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-850675976, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-850675976, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-850675976, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-850675976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-850675976, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-850675976, ~x~0=~x~0_Out-850675976, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-850675976} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:53:23,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1006689771 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1006689771 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1006689771| ~y$w_buff0_used~0_In1006689771) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1006689771|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1006689771} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1006689771|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1006689771, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1006689771} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:53:23,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1938459626 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-1938459626 |P1Thread1of1ForFork1_#t~ite20_Out-1938459626|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1938459626 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1938459626 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1938459626 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1938459626 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite21_Out-1938459626| |P1Thread1of1ForFork1_#t~ite20_Out-1938459626|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1938459626| |P1Thread1of1ForFork1_#t~ite20_Out-1938459626|) (not .cse0) (= ~y$w_buff0_used~0_In-1938459626 |P1Thread1of1ForFork1_#t~ite21_Out-1938459626|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1938459626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938459626, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1938459626|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1938459626, ~weak$$choice2~0=~weak$$choice2~0_In-1938459626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938459626} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1938459626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938459626, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1938459626|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1938459626, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1938459626|, ~weak$$choice2~0=~weak$$choice2~0_In-1938459626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1938459626} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 07:53:23,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1464858873 256))) (.cse5 (= (mod ~y$w_buff0_used~0_In-1464858873 256) 0)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-1464858873 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1464858873 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-1464858873 256) 0)) (.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out-1464858873| |P1Thread1of1ForFork1_#t~ite23_Out-1464858873|))) (or (let ((.cse2 (not .cse6))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1464858873|) .cse0 (or (not .cse1) .cse2) .cse3 (or .cse2 (not .cse4)) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-1464858873| |P1Thread1of1ForFork1_#t~ite22_Out-1464858873|))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1464858873| |P1Thread1of1ForFork1_#t~ite22_Out-1464858873|) (or (and (= ~y$w_buff1_used~0_In-1464858873 |P1Thread1of1ForFork1_#t~ite24_Out-1464858873|) (= |P1Thread1of1ForFork1_#t~ite23_Out-1464858873| |P1Thread1of1ForFork1_#t~ite23_In-1464858873|) (not .cse0)) (and .cse0 (or .cse5 (and .cse4 .cse6) (and .cse1 .cse6)) (= ~y$w_buff1_used~0_In-1464858873 |P1Thread1of1ForFork1_#t~ite23_Out-1464858873|) .cse3))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1464858873, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464858873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1464858873, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1464858873|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1464858873|, ~weak$$choice2~0=~weak$$choice2~0_In-1464858873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464858873} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1464858873, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1464858873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1464858873, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1464858873|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1464858873|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1464858873|, ~weak$$choice2~0=~weak$$choice2~0_In-1464858873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1464858873} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 07:53:23,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} 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 07:53:23,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In652590920 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In652590920 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In652590920 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In652590920 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out652590920|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In652590920 |P0Thread1of1ForFork0_#t~ite6_Out652590920|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In652590920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In652590920, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In652590920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In652590920} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out652590920|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In652590920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In652590920, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In652590920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In652590920} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:53:23,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1990651363 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1990651363 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-1990651363) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-1990651363 ~y$r_buff0_thd1~0_Out-1990651363)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990651363, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1990651363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1990651363, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1990651363|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1990651363} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:53:23,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In561754081 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out561754081| |P1Thread1of1ForFork1_#t~ite29_Out561754081|)) (.cse5 (= (mod ~y$w_buff0_used~0_In561754081 256) 0)) (.cse1 (= (mod ~weak$$choice2~0_In561754081 256) 0)) (.cse4 (= (mod ~y$w_buff1_used~0_In561754081 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In561754081 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In561754081| |P1Thread1of1ForFork1_#t~ite28_Out561754081|) (or (and .cse0 .cse1 (= ~y$r_buff1_thd2~0_In561754081 |P1Thread1of1ForFork1_#t~ite29_Out561754081|) (or (and .cse2 .cse3) (and .cse4 .cse2) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite29_In561754081| |P1Thread1of1ForFork1_#t~ite29_Out561754081|) (= |P1Thread1of1ForFork1_#t~ite30_Out561754081| ~y$r_buff1_thd2~0_In561754081) (not .cse1)))) (let ((.cse6 (not .cse2))) (and (or .cse6 (not .cse3)) .cse0 (not .cse5) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out561754081|) .cse1 (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite29_Out561754081| |P1Thread1of1ForFork1_#t~ite28_Out561754081|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In561754081, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In561754081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In561754081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In561754081, ~weak$$choice2~0=~weak$$choice2~0_In561754081, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In561754081|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561754081} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In561754081, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out561754081|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out561754081|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In561754081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In561754081, ~weak$$choice2~0=~weak$$choice2~0_In561754081, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out561754081|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In561754081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:53:23,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1309163681 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1309163681 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In1309163681 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1309163681 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1309163681| ~y$r_buff1_thd1~0_In1309163681) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1309163681| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1309163681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309163681, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1309163681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309163681} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1309163681, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309163681, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1309163681|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1309163681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309163681} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:53:23,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 07:53:23,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1126112064 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1126112064 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1126112064| ~y~0_In-1126112064)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1126112064| ~y$w_buff1~0_In-1126112064) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1126112064, ~y$w_buff1~0=~y$w_buff1~0_In-1126112064, ~y~0=~y~0_In-1126112064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126112064} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1126112064, ~y$w_buff1~0=~y$w_buff1~0_In-1126112064, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1126112064|, ~y~0=~y~0_In-1126112064, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1126112064} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:53:23,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 07:53:23,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1490003221 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1490003221 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1490003221| 0)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1490003221| ~y$w_buff0_used~0_In-1490003221) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1490003221, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1490003221} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1490003221, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1490003221, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1490003221|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:53:23,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1116610253 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1116610253 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1116610253 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1116610253 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1116610253| ~y$w_buff1_used~0_In1116610253)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out1116610253| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1116610253, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1116610253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1116610253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1116610253} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1116610253, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1116610253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1116610253, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1116610253|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1116610253} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:53:23,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In128598949 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In128598949 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out128598949|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In128598949 |P1Thread1of1ForFork1_#t~ite36_Out128598949|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128598949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128598949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128598949, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In128598949, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out128598949|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:53:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-262592848 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-262592848 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-262592848 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-262592848 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-262592848 |P1Thread1of1ForFork1_#t~ite37_Out-262592848|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-262592848|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-262592848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-262592848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-262592848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262592848} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-262592848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-262592848, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-262592848, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-262592848|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262592848} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:53:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, 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 07:53:23,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, 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_10} 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 07:53:23,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:53:23,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1284707139 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1284707139 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1284707139| ~y$w_buff1~0_In-1284707139) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-1284707139 |ULTIMATE.start_main_#t~ite40_Out-1284707139|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1284707139, ~y~0=~y~0_In-1284707139, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1284707139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1284707139} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1284707139|, ~y$w_buff1~0=~y$w_buff1~0_In-1284707139, ~y~0=~y~0_In-1284707139, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1284707139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1284707139} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:53:23,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |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_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 07:53:23,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In664222517 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In664222517 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out664222517| 0)) (and (= |ULTIMATE.start_main_#t~ite42_Out664222517| ~y$w_buff0_used~0_In664222517) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In664222517, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In664222517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In664222517, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In664222517, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out664222517|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:53:23,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1701534044 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1701534044 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1701534044 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1701534044 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1701534044| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1701534044| ~y$w_buff1_used~0_In-1701534044)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701534044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701534044, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1701534044, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1701534044, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1701534044|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1701534044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1701534044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:53:23,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1165747667 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1165747667 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1165747667|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1165747667 |ULTIMATE.start_main_#t~ite44_Out-1165747667|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165747667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1165747667} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1165747667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1165747667, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1165747667|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:53:23,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-252494501 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-252494501 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-252494501 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-252494501 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-252494501|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-252494501| ~y$r_buff1_thd0~0_In-252494501) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-252494501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-252494501, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-252494501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-252494501} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-252494501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-252494501, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-252494501, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-252494501|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-252494501} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:53:23,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 07:53:23,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:53:23 BasicIcfg [2019-12-27 07:53:23,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:53:23,975 INFO L168 Benchmark]: Toolchain (without parser) took 13543.77 ms. Allocated memory was 137.9 MB in the beginning and 649.6 MB in the end (delta: 511.7 MB). Free memory was 100.8 MB in the beginning and 339.7 MB in the end (delta: -238.9 MB). Peak memory consumption was 272.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,976 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.74 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 155.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,982 INFO L168 Benchmark]: Boogie Preprocessor took 43.47 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,987 INFO L168 Benchmark]: RCFGBuilder took 777.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,988 INFO L168 Benchmark]: TraceAbstraction took 11845.45 ms. Allocated memory was 201.3 MB in the beginning and 649.6 MB in the end (delta: 448.3 MB). Free memory was 106.0 MB in the beginning and 339.7 MB in the end (delta: -233.7 MB). Peak memory consumption was 214.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:53:23,997 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.57 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.74 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 155.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.75 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.47 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.45 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.7 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11845.45 ms. Allocated memory was 201.3 MB in the beginning and 649.6 MB in the end (delta: 448.3 MB). Free memory was 106.0 MB in the beginning and 339.7 MB in the end (delta: -233.7 MB). Peak memory consumption was 214.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4545 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L738] 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_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=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=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=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] [L759] 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_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] [L738] 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) [L759] 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) [L760] 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=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=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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))=0, 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] [L761] 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)) [L762] 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)) [L763] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=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] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1203 SDtfs, 1375 SDslu, 2120 SDs, 0 SdLazy, 1019 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 4805 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 38181 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...