/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:58:44,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:58:44,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:58:44,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:58:44,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:58:44,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:58:44,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:58:44,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:58:44,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:58:44,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:58:44,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:58:44,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:58:44,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:58:44,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:58:44,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:58:44,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:58:44,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:58:44,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:58:44,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:58:44,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:58:44,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:58:44,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:58:44,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:58:44,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:58:44,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:58:44,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:58:44,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:58:44,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:58:44,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:58:44,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:58:44,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:58:44,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:58:44,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:58:44,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:58:44,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:58:44,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:58:44,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:58:44,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:58:44,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:58:44,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:58:44,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:58:44,188 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-MCR.epf [2019-12-27 20:58:44,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:58:44,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:58:44,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:58:44,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:58:44,220 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:58:44,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:58:44,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:58:44,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:58:44,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:58:44,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:58:44,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:58:44,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:58:44,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:58:44,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:58:44,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:58:44,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:58:44,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:58:44,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:58:44,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:58:44,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:58:44,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:58:44,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:58:44,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:58:44,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:58:44,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:58:44,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:58:44,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:58:44,226 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:58:44,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:58:44,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:58:44,227 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:58:44,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:58:44,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:58:44,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:58:44,499 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:58:44,500 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:58:44,501 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:58:44,501 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-27 20:58:44,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a9c0b2b/141d41dbe0b9463bb5cf09271e408785/FLAGa6de935fb [2019-12-27 20:58:45,109 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:58:45,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.oepc.i [2019-12-27 20:58:45,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a9c0b2b/141d41dbe0b9463bb5cf09271e408785/FLAGa6de935fb [2019-12-27 20:58:45,394 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a9c0b2b/141d41dbe0b9463bb5cf09271e408785 [2019-12-27 20:58:45,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:58:45,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:58:45,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:45,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:58:45,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:58:45,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:45" (1/1) ... [2019-12-27 20:58:45,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:45, skipping insertion in model container [2019-12-27 20:58:45,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:58:45" (1/1) ... [2019-12-27 20:58:45,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:58:45,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:58:46,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:46,011 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:58:46,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:58:46,145 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:58:46,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46 WrapperNode [2019-12-27 20:58:46,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:58:46,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:46,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:58:46,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:58:46,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,211 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:58:46,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:58:46,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:58:46,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:58:46,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (1/1) ... [2019-12-27 20:58:46,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:58:46,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:58:46,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:58:46,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:58:46,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (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 20:58:46,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:58:46,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:58:46,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:58:46,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:58:46,313 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:58:46,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:58:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:58:46,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:58:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:58:46,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:58:46,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:58:46,316 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 20:58:47,017 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:58:47,018 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:58:47,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:47 BoogieIcfgContainer [2019-12-27 20:58:47,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:58:47,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:58:47,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:58:47,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:58:47,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:58:45" (1/3) ... [2019-12-27 20:58:47,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807e31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:47, skipping insertion in model container [2019-12-27 20:58:47,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:58:46" (2/3) ... [2019-12-27 20:58:47,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5807e31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:58:47, skipping insertion in model container [2019-12-27 20:58:47,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:58:47" (3/3) ... [2019-12-27 20:58:47,028 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.oepc.i [2019-12-27 20:58:47,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:58:47,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:58:47,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:58:47,044 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:58:47,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,152 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,153 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,161 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:58:47,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:58:47,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:58:47,201 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:58:47,201 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:58:47,201 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:58:47,201 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:58:47,201 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:58:47,202 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:58:47,202 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:58:47,223 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-12-27 20:58:47,226 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:47,336 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:47,336 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:47,350 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:47,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-12-27 20:58:47,429 INFO L132 PetriNetUnfolder]: 41/181 cut-off events. [2019-12-27 20:58:47,429 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:58:47,437 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs. 0/138 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:58:47,452 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:58:47,453 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:58:49,366 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-12-27 20:58:50,954 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 20:58:51,062 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 20:58:51,092 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49761 [2019-12-27 20:58:51,092 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 20:58:51,096 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 83 transitions [2019-12-27 20:58:51,488 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 20:58:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 20:58:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:58:51,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:51,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:58:51,498 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 798121, now seen corresponding path program 1 times [2019-12-27 20:58:51,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:51,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098754173] [2019-12-27 20:58:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:51,733 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 20:58:51,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098754173] [2019-12-27 20:58:51,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:51,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:58:51,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2043946838] [2019-12-27 20:58:51,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:51,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:51,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:58:51,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:51,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:51,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:51,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:51,775 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 20:58:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:52,054 INFO L93 Difference]: Finished difference Result 7842 states and 25482 transitions. [2019-12-27 20:58:52,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:52,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:58:52,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:52,135 INFO L225 Difference]: With dead ends: 7842 [2019-12-27 20:58:52,136 INFO L226 Difference]: Without dead ends: 7386 [2019-12-27 20:58:52,138 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 20:58:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7386 states. [2019-12-27 20:58:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7386 to 7386. [2019-12-27 20:58:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7386 states. [2019-12-27 20:58:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7386 states to 7386 states and 23956 transitions. [2019-12-27 20:58:52,688 INFO L78 Accepts]: Start accepts. Automaton has 7386 states and 23956 transitions. Word has length 3 [2019-12-27 20:58:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:52,689 INFO L462 AbstractCegarLoop]: Abstraction has 7386 states and 23956 transitions. [2019-12-27 20:58:52,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7386 states and 23956 transitions. [2019-12-27 20:58:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:58:52,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:52,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:52,694 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:52,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1045751384, now seen corresponding path program 1 times [2019-12-27 20:58:52,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:52,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042244458] [2019-12-27 20:58:52,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:52,810 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 20:58:52,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042244458] [2019-12-27 20:58:52,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:52,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:52,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1153729711] [2019-12-27 20:58:52,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:52,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:52,815 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:58:52,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:52,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:52,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:52,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:52,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:52,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:52,817 INFO L87 Difference]: Start difference. First operand 7386 states and 23956 transitions. Second operand 3 states. [2019-12-27 20:58:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:52,844 INFO L93 Difference]: Finished difference Result 1203 states and 2726 transitions. [2019-12-27 20:58:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:52,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:58:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:52,852 INFO L225 Difference]: With dead ends: 1203 [2019-12-27 20:58:52,852 INFO L226 Difference]: Without dead ends: 1203 [2019-12-27 20:58:52,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2019-12-27 20:58:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2019-12-27 20:58:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-27 20:58:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 2726 transitions. [2019-12-27 20:58:52,884 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 2726 transitions. Word has length 11 [2019-12-27 20:58:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:52,884 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 2726 transitions. [2019-12-27 20:58:52,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 2726 transitions. [2019-12-27 20:58:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:52,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:52,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:52,886 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1102482469, now seen corresponding path program 1 times [2019-12-27 20:58:52,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:52,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369942329] [2019-12-27 20:58:52,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:52,988 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 20:58:52,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369942329] [2019-12-27 20:58:52,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:52,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:52,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [97171237] [2019-12-27 20:58:52,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:52,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:52,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:52,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:53,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:53,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:53,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:53,001 INFO L87 Difference]: Start difference. First operand 1203 states and 2726 transitions. Second operand 3 states. [2019-12-27 20:58:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:53,095 INFO L93 Difference]: Finished difference Result 1939 states and 4348 transitions. [2019-12-27 20:58:53,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:53,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 20:58:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:53,106 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 20:58:53,107 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 20:58:53,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 20:58:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1336. [2019-12-27 20:58:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-27 20:58:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3074 transitions. [2019-12-27 20:58:53,160 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3074 transitions. Word has length 14 [2019-12-27 20:58:53,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:53,160 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3074 transitions. [2019-12-27 20:58:53,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3074 transitions. [2019-12-27 20:58:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:53,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:53,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:53,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1024507146, now seen corresponding path program 1 times [2019-12-27 20:58:53,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:53,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352633076] [2019-12-27 20:58:53,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:53,269 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 20:58:53,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352633076] [2019-12-27 20:58:53,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:53,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:53,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1302385124] [2019-12-27 20:58:53,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:53,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:53,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:53,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:53,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:53,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:53,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:53,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:53,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:53,281 INFO L87 Difference]: Start difference. First operand 1336 states and 3074 transitions. Second operand 4 states. [2019-12-27 20:58:53,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:53,454 INFO L93 Difference]: Finished difference Result 1693 states and 3800 transitions. [2019-12-27 20:58:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:53,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:53,464 INFO L225 Difference]: With dead ends: 1693 [2019-12-27 20:58:53,464 INFO L226 Difference]: Without dead ends: 1693 [2019-12-27 20:58:53,465 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 20:58:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2019-12-27 20:58:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1629. [2019-12-27 20:58:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-12-27 20:58:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3676 transitions. [2019-12-27 20:58:53,512 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3676 transitions. Word has length 14 [2019-12-27 20:58:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:53,513 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 3676 transitions. [2019-12-27 20:58:53,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3676 transitions. [2019-12-27 20:58:53,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:58:53,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:53,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:53,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash -399327403, now seen corresponding path program 1 times [2019-12-27 20:58:53,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:53,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402682235] [2019-12-27 20:58:53,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:53,597 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 20:58:53,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402682235] [2019-12-27 20:58:53,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:53,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:53,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352771760] [2019-12-27 20:58:53,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:53,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:53,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:58:53,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:53,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:53,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:53,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:53,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:53,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:53,646 INFO L87 Difference]: Start difference. First operand 1629 states and 3676 transitions. Second operand 4 states. [2019-12-27 20:58:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:53,816 INFO L93 Difference]: Finished difference Result 1964 states and 4378 transitions. [2019-12-27 20:58:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:58:53,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 20:58:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:53,827 INFO L225 Difference]: With dead ends: 1964 [2019-12-27 20:58:53,827 INFO L226 Difference]: Without dead ends: 1964 [2019-12-27 20:58:53,828 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 20:58:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-12-27 20:58:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1704. [2019-12-27 20:58:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-27 20:58:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3842 transitions. [2019-12-27 20:58:53,869 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3842 transitions. Word has length 14 [2019-12-27 20:58:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:53,870 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3842 transitions. [2019-12-27 20:58:53,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3842 transitions. [2019-12-27 20:58:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:58:53,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:53,872 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 20:58:53,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:53,873 INFO L82 PathProgramCache]: Analyzing trace with hash -524969657, now seen corresponding path program 1 times [2019-12-27 20:58:53,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:53,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775157293] [2019-12-27 20:58:53,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:53,941 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 20:58:53,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775157293] [2019-12-27 20:58:53,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:53,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493143929] [2019-12-27 20:58:53,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:53,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:53,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:58:53,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:53,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:53,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:53,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:53,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:53,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:53,954 INFO L87 Difference]: Start difference. First operand 1704 states and 3842 transitions. Second operand 5 states. [2019-12-27 20:58:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:54,193 INFO L93 Difference]: Finished difference Result 2231 states and 4892 transitions. [2019-12-27 20:58:54,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:54,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:58:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:54,211 INFO L225 Difference]: With dead ends: 2231 [2019-12-27 20:58:54,211 INFO L226 Difference]: Without dead ends: 2231 [2019-12-27 20:58:54,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-12-27 20:58:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1975. [2019-12-27 20:58:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2019-12-27 20:58:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4398 transitions. [2019-12-27 20:58:54,261 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 4398 transitions. Word has length 25 [2019-12-27 20:58:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:54,261 INFO L462 AbstractCegarLoop]: Abstraction has 1975 states and 4398 transitions. [2019-12-27 20:58:54,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 4398 transitions. [2019-12-27 20:58:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:54,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:54,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:54,264 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1656128157, now seen corresponding path program 1 times [2019-12-27 20:58:54,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:54,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098967308] [2019-12-27 20:58:54,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:58:54,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098967308] [2019-12-27 20:58:54,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:54,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:54,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351723512] [2019-12-27 20:58:54,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:54,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:54,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:58:54,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:54,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:58:54,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:54,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:54,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:54,366 INFO L87 Difference]: Start difference. First operand 1975 states and 4398 transitions. Second operand 5 states. [2019-12-27 20:58:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:54,392 INFO L93 Difference]: Finished difference Result 1031 states and 2198 transitions. [2019-12-27 20:58:54,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:54,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:54,398 INFO L225 Difference]: With dead ends: 1031 [2019-12-27 20:58:54,399 INFO L226 Difference]: Without dead ends: 1031 [2019-12-27 20:58:54,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:54,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-12-27 20:58:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 973. [2019-12-27 20:58:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-12-27 20:58:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2091 transitions. [2019-12-27 20:58:54,424 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2091 transitions. Word has length 26 [2019-12-27 20:58:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:54,424 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 2091 transitions. [2019-12-27 20:58:54,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2091 transitions. [2019-12-27 20:58:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:58:54,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:54,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:54,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2023210146, now seen corresponding path program 1 times [2019-12-27 20:58:54,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:54,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391067774] [2019-12-27 20:58:54,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:54,511 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 20:58:54,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391067774] [2019-12-27 20:58:54,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:54,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:54,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520633685] [2019-12-27 20:58:54,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:54,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:54,564 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 20:58:54,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:54,565 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:54,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:58:54,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:58:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:58:54,568 INFO L87 Difference]: Start difference. First operand 973 states and 2091 transitions. Second operand 5 states. [2019-12-27 20:58:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:54,773 INFO L93 Difference]: Finished difference Result 1107 states and 2333 transitions. [2019-12-27 20:58:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:58:54,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 20:58:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:54,777 INFO L225 Difference]: With dead ends: 1107 [2019-12-27 20:58:54,778 INFO L226 Difference]: Without dead ends: 1107 [2019-12-27 20:58:54,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:58:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-27 20:58:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 869. [2019-12-27 20:58:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-27 20:58:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1878 transitions. [2019-12-27 20:58:54,799 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1878 transitions. Word has length 26 [2019-12-27 20:58:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:54,799 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1878 transitions. [2019-12-27 20:58:54,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:58:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1878 transitions. [2019-12-27 20:58:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:54,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:54,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:58:54,802 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1815455026, now seen corresponding path program 1 times [2019-12-27 20:58:54,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:54,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354112409] [2019-12-27 20:58:54,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:54,916 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 20:58:54,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354112409] [2019-12-27 20:58:54,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:58:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1487644743] [2019-12-27 20:58:54,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:54,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:54,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 92 states and 131 transitions. [2019-12-27 20:58:54,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:55,057 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:58:55,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:58:55,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:58:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:58:55,059 INFO L87 Difference]: Start difference. First operand 869 states and 1878 transitions. Second operand 10 states. [2019-12-27 20:58:55,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:55,540 INFO L93 Difference]: Finished difference Result 2533 states and 5378 transitions. [2019-12-27 20:58:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:58:55,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:58:55,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:55,545 INFO L225 Difference]: With dead ends: 2533 [2019-12-27 20:58:55,545 INFO L226 Difference]: Without dead ends: 1738 [2019-12-27 20:58:55,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-27 20:58:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-12-27 20:58:55,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 983. [2019-12-27 20:58:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-27 20:58:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2118 transitions. [2019-12-27 20:58:55,574 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2118 transitions. Word has length 51 [2019-12-27 20:58:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:55,574 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2118 transitions. [2019-12-27 20:58:55,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:58:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2118 transitions. [2019-12-27 20:58:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:58:55,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:55,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:58:55,578 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 700498790, now seen corresponding path program 2 times [2019-12-27 20:58:55,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:55,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436100734] [2019-12-27 20:58:55,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:55,725 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 20:58:55,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436100734] [2019-12-27 20:58:55,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:55,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:55,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1247225424] [2019-12-27 20:58:55,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:55,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:55,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 142 transitions. [2019-12-27 20:58:55,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:55,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:55,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:55,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:55,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:55,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:55,796 INFO L87 Difference]: Start difference. First operand 983 states and 2118 transitions. Second operand 3 states. [2019-12-27 20:58:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:55,838 INFO L93 Difference]: Finished difference Result 1302 states and 2767 transitions. [2019-12-27 20:58:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:55,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:58:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:55,841 INFO L225 Difference]: With dead ends: 1302 [2019-12-27 20:58:55,841 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 20:58:55,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 5 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 20:58:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 20:58:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1086. [2019-12-27 20:58:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-12-27 20:58:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2341 transitions. [2019-12-27 20:58:55,867 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2341 transitions. Word has length 51 [2019-12-27 20:58:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:55,867 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 2341 transitions. [2019-12-27 20:58:55,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2341 transitions. [2019-12-27 20:58:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:55,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:55,870 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 20:58:55,870 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1020694631, now seen corresponding path program 1 times [2019-12-27 20:58:55,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:55,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192207342] [2019-12-27 20:58:55,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:55,951 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 20:58:55,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192207342] [2019-12-27 20:58:55,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:55,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:58:55,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [867103110] [2019-12-27 20:58:55,952 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:55,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:56,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 146 transitions. [2019-12-27 20:58:56,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:56,116 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:58:56,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:58:56,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:58:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:58:56,118 INFO L87 Difference]: Start difference. First operand 1086 states and 2341 transitions. Second operand 4 states. [2019-12-27 20:58:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:56,185 INFO L93 Difference]: Finished difference Result 1086 states and 2329 transitions. [2019-12-27 20:58:56,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:58:56,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 20:58:56,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:56,187 INFO L225 Difference]: With dead ends: 1086 [2019-12-27 20:58:56,188 INFO L226 Difference]: Without dead ends: 1086 [2019-12-27 20:58:56,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 5 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 20:58:56,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-12-27 20:58:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 983. [2019-12-27 20:58:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2019-12-27 20:58:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 2106 transitions. [2019-12-27 20:58:56,207 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 2106 transitions. Word has length 52 [2019-12-27 20:58:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:56,207 INFO L462 AbstractCegarLoop]: Abstraction has 983 states and 2106 transitions. [2019-12-27 20:58:56,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:58:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 2106 transitions. [2019-12-27 20:58:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:58:56,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:56,211 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 20:58:56,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1332632369, now seen corresponding path program 1 times [2019-12-27 20:58:56,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:56,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525539637] [2019-12-27 20:58:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:58:56,350 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 20:58:56,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525539637] [2019-12-27 20:58:56,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:58:56,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:58:56,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244598483] [2019-12-27 20:58:56,351 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:58:56,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:58:56,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 100 transitions. [2019-12-27 20:58:56,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:58:56,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:58:56,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:58:56,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:58:56,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:58:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:58:56,415 INFO L87 Difference]: Start difference. First operand 983 states and 2106 transitions. Second operand 3 states. [2019-12-27 20:58:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:58:56,432 INFO L93 Difference]: Finished difference Result 982 states and 2104 transitions. [2019-12-27 20:58:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:58:56,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:58:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:58:56,437 INFO L225 Difference]: With dead ends: 982 [2019-12-27 20:58:56,437 INFO L226 Difference]: Without dead ends: 982 [2019-12-27 20:58:56,437 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 20:58:56,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-27 20:58:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 836. [2019-12-27 20:58:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-12-27 20:58:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1828 transitions. [2019-12-27 20:58:56,457 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1828 transitions. Word has length 52 [2019-12-27 20:58:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:58:56,458 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1828 transitions. [2019-12-27 20:58:56,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:58:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1828 transitions. [2019-12-27 20:58:56,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:58:56,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:58:56,460 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 20:58:56,461 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:58:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:58:56,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1167104957, now seen corresponding path program 1 times [2019-12-27 20:58:56,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:58:56,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786431873] [2019-12-27 20:58:56,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:58:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:58:56,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:58:56,624 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:58:56,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= |v_#valid_48| (store .cse0 |v_ULTIMATE.start_main_~#t909~0.base_27| 1)) (= v_~z$w_buff0_used~0_109 0) (= v_~main$tmp_guard0~0_7 0) (= v_~z~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t909~0.base_27|)) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd2~0_79 0) (= 0 v_~z$flush_delayed~0_13) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t909~0.base_27|) |v_ULTIMATE.start_main_~#t909~0.offset_20| 0)) |v_#memory_int_15|) (= 0 v_~y~0_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t909~0.base_27|) (= 0 v_~z$r_buff1_thd1~0_18) (= 0 v_~x~0_7) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_24 0) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t909~0.base_27| 4) |v_#length_15|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$w_buff1_used~0_69) (= v_~__unbuffered_p1_EBX~0_13 0) (= |v_ULTIMATE.start_main_~#t909~0.offset_20| 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd2~0_50) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_50, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_~#t909~0.offset=|v_ULTIMATE.start_main_~#t909~0.offset_20|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_22|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ULTIMATE.start_main_~#t909~0.base=|v_ULTIMATE.start_main_~#t909~0.base_27|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, #length=|v_#length_15|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_79, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_16|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_48|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_18, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t909~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t909~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t910~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 20:58:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L804-1-->L806: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t910~0.base_13|) |v_ULTIMATE.start_main_~#t910~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t910~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13| 1) |v_#valid_29|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t910~0.base_13|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t910~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t910~0.offset_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t910~0.base_13| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t910~0.base=|v_ULTIMATE.start_main_~#t910~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t910~0.offset=|v_ULTIMATE.start_main_~#t910~0.offset_11|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t910~0.base, ULTIMATE.start_main_~#t910~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:58:56,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out-734777683 ~z$w_buff0~0_In-734777683) (= ~z$w_buff0~0_Out-734777683 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-734777683| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-734777683) (= |P0Thread1of1ForFork0_#in~arg.base_In-734777683| P0Thread1of1ForFork0_~arg.base_Out-734777683) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-734777683|) (= ~z$w_buff0_used~0_Out-734777683 1) (= ~z$w_buff0_used~0_In-734777683 ~z$w_buff1_used~0_Out-734777683) (= 0 (mod ~z$w_buff1_used~0_Out-734777683 256)) (= P0Thread1of1ForFork0_~arg.offset_Out-734777683 |P0Thread1of1ForFork0_#in~arg.offset_In-734777683|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-734777683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-734777683, ~z$w_buff0~0=~z$w_buff0~0_In-734777683, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-734777683|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-734777683|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-734777683, ~z$w_buff0~0=~z$w_buff0~0_Out-734777683, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-734777683, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-734777683, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-734777683|, ~z$w_buff1~0=~z$w_buff1~0_Out-734777683, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-734777683, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-734777683|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-734777683} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 20:58:56,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L773-->L773-8: Formula: (let ((.cse4 (= (mod ~z$r_buff1_thd2~0_In2101899517 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2101899517 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In2101899517 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2101899517 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out2101899517| |P1Thread1of1ForFork1_#t~ite23_Out2101899517|)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2101899517 256)))) (or (and (or (and (= ~z$w_buff1_used~0_In2101899517 |P1Thread1of1ForFork1_#t~ite23_Out2101899517|) .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In2101899517| |P1Thread1of1ForFork1_#t~ite23_Out2101899517|) (= |P1Thread1of1ForFork1_#t~ite24_Out2101899517| ~z$w_buff1_used~0_In2101899517))) (= |P1Thread1of1ForFork1_#t~ite22_In2101899517| |P1Thread1of1ForFork1_#t~ite22_Out2101899517|)) (let ((.cse6 (not .cse2))) (and (or (not .cse4) .cse6) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out2101899517|) (= |P1Thread1of1ForFork1_#t~ite22_Out2101899517| |P1Thread1of1ForFork1_#t~ite23_Out2101899517|) (not .cse1) .cse0 (or (not .cse3) .cse6) .cse5)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2101899517, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2101899517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101899517, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In2101899517|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In2101899517|, ~weak$$choice2~0=~weak$$choice2~0_In2101899517, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2101899517} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2101899517, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2101899517, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out2101899517|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101899517, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out2101899517|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out2101899517|, ~weak$$choice2~0=~weak$$choice2~0_In2101899517, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2101899517} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:58:56,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L774-->L775: Formula: (and (= v_~z$r_buff0_thd2~0_64 v_~z$r_buff0_thd2~0_63) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_64} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_63, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:58:56,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L775-->L775-8: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite30_Out1390097220| |P1Thread1of1ForFork1_#t~ite29_Out1390097220|)) (.cse4 (= (mod ~z$w_buff0_used~0_In1390097220 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1390097220 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1390097220 256))) (.cse6 (= (mod ~z$r_buff0_thd2~0_In1390097220 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In1390097220 256)))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite28_Out1390097220| 0) (or (not .cse0) .cse1) .cse2 (or (not .cse3) .cse1) (not .cse4) .cse5 (= |P1Thread1of1ForFork1_#t~ite28_Out1390097220| |P1Thread1of1ForFork1_#t~ite29_Out1390097220|))) (and (= |P1Thread1of1ForFork1_#t~ite28_In1390097220| |P1Thread1of1ForFork1_#t~ite28_Out1390097220|) (or (and .cse2 (or .cse4 (and .cse6 .cse0) (and .cse3 .cse6)) .cse5 (= ~z$r_buff1_thd2~0_In1390097220 |P1Thread1of1ForFork1_#t~ite29_Out1390097220|)) (and (not .cse5) (= |P1Thread1of1ForFork1_#t~ite29_In1390097220| |P1Thread1of1ForFork1_#t~ite29_Out1390097220|) (= |P1Thread1of1ForFork1_#t~ite30_Out1390097220| ~z$r_buff1_thd2~0_In1390097220)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1390097220|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390097220, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1390097220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390097220, ~weak$$choice2~0=~weak$$choice2~0_In1390097220, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1390097220, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1390097220|} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1390097220|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1390097220|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390097220, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1390097220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390097220, ~weak$$choice2~0=~weak$$choice2~0_In1390097220, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1390097220, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1390097220|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:58:56,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_17 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 20:58:56,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2055682708 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2055682708 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2055682708|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2055682708| ~z$w_buff0_used~0_In2055682708) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2055682708, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2055682708} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2055682708|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2055682708, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2055682708} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:58:56,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In744878740 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In744878740 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In744878740 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In744878740 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out744878740| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out744878740| ~z$w_buff1_used~0_In744878740) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In744878740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In744878740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In744878740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In744878740} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out744878740|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In744878740, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In744878740, ~z$w_buff1_used~0=~z$w_buff1_used~0_In744878740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In744878740} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:58:56,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In542451493 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In542451493 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In542451493 ~z$r_buff0_thd1~0_Out542451493)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out542451493 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In542451493, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In542451493} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In542451493, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out542451493|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out542451493} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:58:56,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-356087363 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-356087363 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-356087363 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-356087363 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-356087363|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-356087363 |P0Thread1of1ForFork0_#t~ite8_Out-356087363|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-356087363, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-356087363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-356087363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-356087363} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-356087363, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-356087363|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-356087363, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-356087363, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-356087363} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:58:56,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-225493820| |P1Thread1of1ForFork1_#t~ite32_Out-225493820|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-225493820 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-225493820 256)))) (or (and .cse0 (= ~z~0_In-225493820 |P1Thread1of1ForFork1_#t~ite32_Out-225493820|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-225493820 |P1Thread1of1ForFork1_#t~ite32_Out-225493820|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-225493820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225493820, ~z$w_buff1~0=~z$w_buff1~0_In-225493820, ~z~0=~z~0_In-225493820} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-225493820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-225493820, ~z$w_buff1~0=~z$w_buff1~0_In-225493820, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-225493820|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-225493820|, ~z~0=~z~0_In-225493820} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:58:56,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-607658197 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-607658197 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-607658197|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-607658197| ~z$w_buff0_used~0_In-607658197)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-607658197, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-607658197} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-607658197, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-607658197|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-607658197} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:58:56,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1564215376 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1564215376 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1564215376 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1564215376 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1564215376|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1564215376| ~z$w_buff1_used~0_In1564215376)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1564215376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1564215376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1564215376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1564215376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1564215376, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1564215376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1564215376, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1564215376|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1564215376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:58:56,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-556180397 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-556180397 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-556180397| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In-556180397 |P1Thread1of1ForFork1_#t~ite36_Out-556180397|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-556180397, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-556180397} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-556180397, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-556180397, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-556180397|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:58:56,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1664615402 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1664615402 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1664615402 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1664615402 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1664615402| ~z$r_buff1_thd2~0_In1664615402) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1664615402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1664615402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1664615402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1664615402, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1664615402} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1664615402, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1664615402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1664615402, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1664615402, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1664615402|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:56,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_40 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_40, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:58:56,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_13, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:58:56,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 20:58:56,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1498295375 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1498295375 256) 0))) (or (and (= ~z$w_buff1~0_In-1498295375 |ULTIMATE.start_main_#t~ite40_Out-1498295375|) (not .cse0) (not .cse1)) (and (= ~z~0_In-1498295375 |ULTIMATE.start_main_#t~ite40_Out-1498295375|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498295375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498295375, ~z$w_buff1~0=~z$w_buff1~0_In-1498295375, ~z~0=~z~0_In-1498295375} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1498295375|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1498295375, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1498295375, ~z$w_buff1~0=~z$w_buff1~0_In-1498295375, ~z~0=~z~0_In-1498295375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:58:56,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_15 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 20:58:56,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1382814529 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1382814529 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1382814529 |ULTIMATE.start_main_#t~ite42_Out1382814529|)) (and (= |ULTIMATE.start_main_#t~ite42_Out1382814529| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382814529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382814529} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1382814529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1382814529, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1382814529|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:58:56,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-686320139 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-686320139 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-686320139 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-686320139 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-686320139| ~z$w_buff1_used~0_In-686320139)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite43_Out-686320139| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686320139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686320139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-686320139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686320139} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686320139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686320139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-686320139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686320139, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-686320139|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:58:56,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In68252373 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In68252373 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out68252373| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out68252373| ~z$r_buff0_thd0~0_In68252373) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In68252373, ~z$w_buff0_used~0=~z$w_buff0_used~0_In68252373} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In68252373, ~z$w_buff0_used~0=~z$w_buff0_used~0_In68252373, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out68252373|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:58:56,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1344102354 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1344102354 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1344102354 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1344102354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1344102354| ~z$r_buff1_thd0~0_In1344102354) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1344102354| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1344102354, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1344102354, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1344102354, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1344102354} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1344102354, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1344102354, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1344102354, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1344102354, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1344102354|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:58:56,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p0_EAX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~z$r_buff1_thd0~0_14) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, 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_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:58:56,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:58:56 BasicIcfg [2019-12-27 20:58:56,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:58:56,721 INFO L168 Benchmark]: Toolchain (without parser) took 11315.25 ms. Allocated memory was 138.9 MB in the beginning and 413.7 MB in the end (delta: 274.7 MB). Free memory was 102.2 MB in the beginning and 113.1 MB in the end (delta: -10.9 MB). Peak memory consumption was 263.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,722 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.27 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,726 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,726 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,727 INFO L168 Benchmark]: RCFGBuilder took 770.76 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.2 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,727 INFO L168 Benchmark]: TraceAbstraction took 9696.32 ms. Allocated memory was 203.4 MB in the beginning and 413.7 MB in the end (delta: 210.2 MB). Free memory was 108.2 MB in the beginning and 113.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 205.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:58:56,736 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.27 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.8 MB in the beginning and 157.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.6 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.76 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.2 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9696.32 ms. Allocated memory was 203.4 MB in the beginning and 413.7 MB in the end (delta: 210.2 MB). Free memory was 108.2 MB in the beginning and 113.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 205.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 149 ProgramPointsBefore, 74 ProgramPointsAfterwards, 183 TransitionsBefore, 83 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 28 ChoiceCompositions, 4346 VarBasedMoverChecksPositive, 182 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49761 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t909, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t910, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1347 SDtfs, 890 SDslu, 3006 SDs, 0 SdLazy, 1086 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 14 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 2699 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 57359 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...