/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:18:37,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:18:37,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:18:37,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:18:37,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:18:37,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:18:37,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:18:37,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:18:37,137 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:18:37,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:18:37,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:18:37,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:18:37,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:18:37,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:18:37,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:18:37,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:18:37,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:18:37,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:18:37,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:18:37,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:18:37,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:18:37,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:18:37,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:18:37,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:18:37,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:18:37,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:18:37,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:18:37,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:18:37,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:18:37,157 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:18:37,157 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:18:37,158 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:18:37,159 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:18:37,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:18:37,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:18:37,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:18:37,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:18:37,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:18:37,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:18:37,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:18:37,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:18:37,164 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-SemanticLbe-MCR.epf [2019-12-27 16:18:37,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:18:37,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:18:37,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:18:37,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:18:37,180 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:18:37,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:18:37,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:18:37,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:18:37,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:18:37,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:18:37,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:18:37,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:18:37,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:18:37,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:18:37,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:18:37,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:18:37,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:18:37,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:18:37,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:18:37,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:18:37,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:18:37,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:18:37,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:18:37,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:18:37,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:18:37,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:18:37,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:18:37,185 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:18:37,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:18:37,185 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:18:37,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:18:37,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:18:37,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:18:37,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:18:37,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:18:37,471 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:18:37,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-27 16:18:37,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d091b29f3/8de3fadc6d1848c294b672112d66449f/FLAG96624eab7 [2019-12-27 16:18:38,087 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:18:38,088 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.opt.i [2019-12-27 16:18:38,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d091b29f3/8de3fadc6d1848c294b672112d66449f/FLAG96624eab7 [2019-12-27 16:18:38,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d091b29f3/8de3fadc6d1848c294b672112d66449f [2019-12-27 16:18:38,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:18:38,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:18:38,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:38,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:18:38,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:18:38,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:38" (1/1) ... [2019-12-27 16:18:38,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e400b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:38, skipping insertion in model container [2019-12-27 16:18:38,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:18:38" (1/1) ... [2019-12-27 16:18:38,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:18:38,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:18:38,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:38,968 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:18:39,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:18:39,134 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:18:39,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39 WrapperNode [2019-12-27 16:18:39,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:18:39,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:39,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:18:39,136 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:18:39,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:18:39,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:18:39,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:18:39,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:18:39,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... [2019-12-27 16:18:39,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:18:39,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:18:39,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:18:39,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:18:39,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:18:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:18:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:18:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:18:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:18:39,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:18:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:18:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:18:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:18:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:18:39,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:18:39,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:18:39,343 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 16:18:40,183 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:18:40,184 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:18:40,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:40 BoogieIcfgContainer [2019-12-27 16:18:40,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:18:40,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:18:40,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:18:40,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:18:40,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:18:38" (1/3) ... [2019-12-27 16:18:40,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a277a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:40, skipping insertion in model container [2019-12-27 16:18:40,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:18:39" (2/3) ... [2019-12-27 16:18:40,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a277a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:18:40, skipping insertion in model container [2019-12-27 16:18:40,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:18:40" (3/3) ... [2019-12-27 16:18:40,201 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt.i [2019-12-27 16:18:40,211 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:18:40,212 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:18:40,223 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:18:40,224 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:18:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:18:40,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:18:40,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:18:40,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:18:40,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:18:40,415 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:18:40,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:18:40,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:18:40,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:18:40,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:18:40,431 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-27 16:18:40,432 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 16:18:40,551 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 16:18:40,552 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:40,571 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 16:18:40,599 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-27 16:18:40,673 INFO L132 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-27 16:18:40,673 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:18:40,683 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 512 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 16:18:40,711 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-27 16:18:40,713 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:18:46,478 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 16:18:46,623 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-12-27 16:18:46,623 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 16:18:46,627 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-27 16:18:48,394 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-27 16:18:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-27 16:18:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:18:48,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:48,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:18:48,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-12-27 16:18:48,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:48,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898769383] [2019-12-27 16:18:48,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:48,732 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 16:18:48,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898769383] [2019-12-27 16:18:48,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:48,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:18:48,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1044844715] [2019-12-27 16:18:48,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:48,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:48,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:18:48,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:48,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:48,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:18:48,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:18:48,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:18:48,778 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-27 16:18:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:50,131 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-27 16:18:50,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:18:50,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:18:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:50,335 INFO L225 Difference]: With dead ends: 27436 [2019-12-27 16:18:50,335 INFO L226 Difference]: Without dead ends: 26890 [2019-12-27 16:18:50,336 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 16:18:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-27 16:18:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-27 16:18:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-27 16:18:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-27 16:18:51,798 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-27 16:18:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:51,798 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-27 16:18:51,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:18:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-27 16:18:51,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:18:51,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:51,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:51,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:51,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:51,806 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-12-27 16:18:51,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:51,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725226934] [2019-12-27 16:18:51,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:51,910 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 16:18:51,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725226934] [2019-12-27 16:18:51,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:51,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:51,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1633889209] [2019-12-27 16:18:51,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:51,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:51,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 16:18:51,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:51,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:18:51,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:18:51,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:51,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:18:51,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:18:51,965 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 5 states. [2019-12-27 16:18:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:53,586 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-27 16:18:53,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:53,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 16:18:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:53,760 INFO L225 Difference]: With dead ends: 43282 [2019-12-27 16:18:53,760 INFO L226 Difference]: Without dead ends: 43275 [2019-12-27 16:18:53,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:18:54,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-27 16:18:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-27 16:18:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-27 16:18:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-27 16:18:57,141 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-27 16:18:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:18:57,141 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-27 16:18:57,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:18:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-27 16:18:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:18:57,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:18:57,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:18:57,148 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:18:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:18:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-12-27 16:18:57,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:18:57,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939595089] [2019-12-27 16:18:57,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:18:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:18:57,263 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 16:18:57,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939595089] [2019-12-27 16:18:57,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:18:57,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:18:57,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1046526350] [2019-12-27 16:18:57,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:18:57,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:18:57,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:18:57,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:18:57,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:18:57,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:18:57,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:18:57,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:18:57,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:18:57,269 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-27 16:18:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:18:57,770 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-27 16:18:57,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:18:57,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:18:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:18:57,940 INFO L225 Difference]: With dead ends: 53078 [2019-12-27 16:18:57,941 INFO L226 Difference]: Without dead ends: 53078 [2019-12-27 16:18:57,941 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 16:18:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-27 16:18:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-27 16:18:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-27 16:19:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-27 16:19:00,224 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-27 16:19:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:00,225 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-27 16:19:00,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:19:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-27 16:19:00,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:19:00,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:00,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:00,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-12-27 16:19:00,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:00,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798190280] [2019-12-27 16:19:00,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:00,326 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 16:19:00,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798190280] [2019-12-27 16:19:00,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:00,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:19:00,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069710858] [2019-12-27 16:19:00,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:00,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:00,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 16:19:00,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:00,452 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:19:00,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:19:00,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:00,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:19:00,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:19:00,454 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 8 states. [2019-12-27 16:19:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:02,242 INFO L93 Difference]: Finished difference Result 64720 states and 215540 transitions. [2019-12-27 16:19:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:19:02,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 16:19:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:02,359 INFO L225 Difference]: With dead ends: 64720 [2019-12-27 16:19:02,359 INFO L226 Difference]: Without dead ends: 64713 [2019-12-27 16:19:02,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:19:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64713 states. [2019-12-27 16:19:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64713 to 47611. [2019-12-27 16:19:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-27 16:19:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-27 16:19:05,499 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-27 16:19:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:05,499 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-27 16:19:05,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:19:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-27 16:19:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:19:05,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:05,523 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 16:19:05,523 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:05,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-12-27 16:19:05,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:05,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262578720] [2019-12-27 16:19:05,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:05,601 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 16:19:05,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262578720] [2019-12-27 16:19:05,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:05,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:19:05,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791482065] [2019-12-27 16:19:05,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:05,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:05,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 16:19:05,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:05,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:05,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:19:05,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:05,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:19:05,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:19:05,612 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-27 16:19:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:05,657 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-27 16:19:05,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:19:05,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 16:19:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:05,665 INFO L225 Difference]: With dead ends: 5620 [2019-12-27 16:19:05,665 INFO L226 Difference]: Without dead ends: 4725 [2019-12-27 16:19:05,666 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 16:19:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-27 16:19:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-27 16:19:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-27 16:19:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-27 16:19:05,744 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-27 16:19:05,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:05,744 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-27 16:19:05,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:19:05,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-27 16:19:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 16:19:05,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:05,749 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] [2019-12-27 16:19:05,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-12-27 16:19:05,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:05,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034411928] [2019-12-27 16:19:05,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:19:05,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034411928] [2019-12-27 16:19:05,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:19:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791706057] [2019-12-27 16:19:05,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:05,860 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:05,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 16:19:05,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:05,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:19:05,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:19:05,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:19:05,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:19:05,895 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 6 states. [2019-12-27 16:19:05,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:05,944 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-27 16:19:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:19:05,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 16:19:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:05,948 INFO L225 Difference]: With dead ends: 1095 [2019-12-27 16:19:05,948 INFO L226 Difference]: Without dead ends: 991 [2019-12-27 16:19:05,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:19:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-27 16:19:05,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-27 16:19:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-27 16:19:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-27 16:19:05,961 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-27 16:19:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:05,962 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-27 16:19:05,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:19:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-27 16:19:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:19:05,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:05,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:05,966 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-12-27 16:19:05,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:05,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441713927] [2019-12-27 16:19:05,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:06,076 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 16:19:06,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441713927] [2019-12-27 16:19:06,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:06,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:19:06,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2040331170] [2019-12-27 16:19:06,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:06,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:06,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 184 transitions. [2019-12-27 16:19:06,162 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:06,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:19:06,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:19:06,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:19:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:19:06,191 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-27 16:19:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:06,830 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-27 16:19:06,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:19:06,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 16:19:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:06,833 INFO L225 Difference]: With dead ends: 1405 [2019-12-27 16:19:06,833 INFO L226 Difference]: Without dead ends: 1405 [2019-12-27 16:19:06,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:19:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-27 16:19:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-27 16:19:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-27 16:19:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-27 16:19:06,845 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-27 16:19:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:06,845 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-27 16:19:06,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:19:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-27 16:19:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 16:19:06,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:06,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:06,848 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-12-27 16:19:06,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:06,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027222346] [2019-12-27 16:19:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:07,189 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 16:19:07,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027222346] [2019-12-27 16:19:07,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:07,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:19:07,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705365087] [2019-12-27 16:19:07,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:07,211 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:07,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 107 transitions. [2019-12-27 16:19:07,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:07,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:07,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:19:07,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:19:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:19:07,255 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-27 16:19:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:07,268 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-27 16:19:07,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:19:07,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-27 16:19:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:07,274 INFO L225 Difference]: With dead ends: 963 [2019-12-27 16:19:07,275 INFO L226 Difference]: Without dead ends: 963 [2019-12-27 16:19:07,275 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 16:19:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-27 16:19:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-27 16:19:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-27 16:19:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-27 16:19:07,288 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-27 16:19:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:07,288 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-27 16:19:07,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:19:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-27 16:19:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 16:19:07,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:07,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:07,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-12-27 16:19:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851231074] [2019-12-27 16:19:07,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:07,386 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 16:19:07,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851231074] [2019-12-27 16:19:07,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:07,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:19:07,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303146645] [2019-12-27 16:19:07,388 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:07,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:07,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 185 transitions. [2019-12-27 16:19:07,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:07,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:19:07,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:19:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:07,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:19:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:19:07,520 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-27 16:19:07,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:07,738 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-27 16:19:07,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:19:07,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 16:19:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:07,740 INFO L225 Difference]: With dead ends: 1101 [2019-12-27 16:19:07,741 INFO L226 Difference]: Without dead ends: 1101 [2019-12-27 16:19:07,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:19:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-27 16:19:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-27 16:19:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-27 16:19:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-27 16:19:07,752 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-27 16:19:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:07,752 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-27 16:19:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:19:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-27 16:19:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 16:19:07,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:07,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:07,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-12-27 16:19:07,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:07,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864676545] [2019-12-27 16:19:07,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:07,920 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 16:19:07,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864676545] [2019-12-27 16:19:07,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:07,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:19:07,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117936586] [2019-12-27 16:19:07,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:07,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:07,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 90 states and 108 transitions. [2019-12-27 16:19:07,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:08,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:19:08,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:19:08,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:19:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:19:08,002 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 9 states. [2019-12-27 16:19:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:08,964 INFO L93 Difference]: Finished difference Result 2310 states and 4752 transitions. [2019-12-27 16:19:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 16:19:08,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-12-27 16:19:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:08,968 INFO L225 Difference]: With dead ends: 2310 [2019-12-27 16:19:08,969 INFO L226 Difference]: Without dead ends: 2310 [2019-12-27 16:19:08,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:19:08,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-12-27 16:19:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1613. [2019-12-27 16:19:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-12-27 16:19:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 3368 transitions. [2019-12-27 16:19:08,987 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 3368 transitions. Word has length 69 [2019-12-27 16:19:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:08,987 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 3368 transitions. [2019-12-27 16:19:08,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:19:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 3368 transitions. [2019-12-27 16:19:08,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 16:19:08,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:08,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:08,990 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1502663669, now seen corresponding path program 1 times [2019-12-27 16:19:08,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:08,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664456748] [2019-12-27 16:19:08,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:09,360 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 16:19:09,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664456748] [2019-12-27 16:19:09,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:09,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:19:09,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1298846142] [2019-12-27 16:19:09,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:09,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:09,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 186 transitions. [2019-12-27 16:19:09,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 16:19:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:19:09,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:19:09,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:19:09,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:09,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:19:09,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:19:09,487 INFO L87 Difference]: Start difference. First operand 1613 states and 3368 transitions. Second operand 7 states. [2019-12-27 16:19:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:09,757 INFO L93 Difference]: Finished difference Result 1707 states and 3507 transitions. [2019-12-27 16:19:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:19:09,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 16:19:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:09,760 INFO L225 Difference]: With dead ends: 1707 [2019-12-27 16:19:09,761 INFO L226 Difference]: Without dead ends: 1707 [2019-12-27 16:19:09,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:19:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-12-27 16:19:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1569. [2019-12-27 16:19:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2019-12-27 16:19:09,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 3224 transitions. [2019-12-27 16:19:09,779 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 3224 transitions. Word has length 70 [2019-12-27 16:19:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:09,780 INFO L462 AbstractCegarLoop]: Abstraction has 1569 states and 3224 transitions. [2019-12-27 16:19:09,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:19:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 3224 transitions. [2019-12-27 16:19:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 16:19:09,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:09,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:09,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:09,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1111665185, now seen corresponding path program 2 times [2019-12-27 16:19:09,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:09,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514405033] [2019-12-27 16:19:09,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:19:09,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514405033] [2019-12-27 16:19:09,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:09,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:19:09,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313030884] [2019-12-27 16:19:09,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:09,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:10,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 168 transitions. [2019-12-27 16:19:10,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:10,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:19:10,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:19:10,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:19:10,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:19:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:19:10,110 INFO L87 Difference]: Start difference. First operand 1569 states and 3224 transitions. Second operand 8 states. [2019-12-27 16:19:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:10,488 INFO L93 Difference]: Finished difference Result 1797 states and 3645 transitions. [2019-12-27 16:19:10,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:19:10,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-27 16:19:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:10,491 INFO L225 Difference]: With dead ends: 1797 [2019-12-27 16:19:10,491 INFO L226 Difference]: Without dead ends: 1797 [2019-12-27 16:19:10,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:19:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-12-27 16:19:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1336. [2019-12-27 16:19:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-27 16:19:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2719 transitions. [2019-12-27 16:19:10,505 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2719 transitions. Word has length 70 [2019-12-27 16:19:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 2719 transitions. [2019-12-27 16:19:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:19:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2719 transitions. [2019-12-27 16:19:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 16:19:10,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:10,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:10,507 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 330269131, now seen corresponding path program 3 times [2019-12-27 16:19:10,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:10,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286693804] [2019-12-27 16:19:10,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:10,645 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 16:19:10,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286693804] [2019-12-27 16:19:10,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:10,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:19:10,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1165277377] [2019-12-27 16:19:10,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:10,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:10,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 124 transitions. [2019-12-27 16:19:10,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:10,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:19:10,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:19:10,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:10,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:19:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:19:10,729 INFO L87 Difference]: Start difference. First operand 1336 states and 2719 transitions. Second operand 7 states. [2019-12-27 16:19:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:11,370 INFO L93 Difference]: Finished difference Result 1514 states and 3049 transitions. [2019-12-27 16:19:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:19:11,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 16:19:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:11,372 INFO L225 Difference]: With dead ends: 1514 [2019-12-27 16:19:11,372 INFO L226 Difference]: Without dead ends: 1514 [2019-12-27 16:19:11,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:19:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-27 16:19:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1284. [2019-12-27 16:19:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-12-27 16:19:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2610 transitions. [2019-12-27 16:19:11,393 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2610 transitions. Word has length 70 [2019-12-27 16:19:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:11,393 INFO L462 AbstractCegarLoop]: Abstraction has 1284 states and 2610 transitions. [2019-12-27 16:19:11,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:19:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2610 transitions. [2019-12-27 16:19:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 16:19:11,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:11,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:11,396 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1241316174, now seen corresponding path program 1 times [2019-12-27 16:19:11,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:11,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647786309] [2019-12-27 16:19:11,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:11,480 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 16:19:11,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647786309] [2019-12-27 16:19:11,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:11,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:19:11,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [587885146] [2019-12-27 16:19:11,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:11,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:11,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 108 transitions. [2019-12-27 16:19:11,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:11,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:19:11,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:19:11,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:19:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:19:11,548 INFO L87 Difference]: Start difference. First operand 1284 states and 2610 transitions. Second operand 3 states. [2019-12-27 16:19:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:11,589 INFO L93 Difference]: Finished difference Result 1283 states and 2608 transitions. [2019-12-27 16:19:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:19:11,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 16:19:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:11,592 INFO L225 Difference]: With dead ends: 1283 [2019-12-27 16:19:11,592 INFO L226 Difference]: Without dead ends: 1283 [2019-12-27 16:19:11,592 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 16:19:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-27 16:19:11,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1086. [2019-12-27 16:19:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-12-27 16:19:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2218 transitions. [2019-12-27 16:19:11,608 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2218 transitions. Word has length 70 [2019-12-27 16:19:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:11,608 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 2218 transitions. [2019-12-27 16:19:11,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:19:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2218 transitions. [2019-12-27 16:19:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 16:19:11,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:11,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:11,611 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:11,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:11,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-12-27 16:19:11,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:11,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801168889] [2019-12-27 16:19:11,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:19:11,737 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 16:19:11,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801168889] [2019-12-27 16:19:11,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:19:11,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:19:11,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162087373] [2019-12-27 16:19:11,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:19:11,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:19:11,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 199 transitions. [2019-12-27 16:19:11,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:19:11,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:19:11,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:19:11,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:19:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:19:11,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:19:11,883 INFO L87 Difference]: Start difference. First operand 1086 states and 2218 transitions. Second operand 7 states. [2019-12-27 16:19:11,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:19:11,994 INFO L93 Difference]: Finished difference Result 1367 states and 2761 transitions. [2019-12-27 16:19:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:19:11,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-27 16:19:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:19:11,996 INFO L225 Difference]: With dead ends: 1367 [2019-12-27 16:19:11,996 INFO L226 Difference]: Without dead ends: 248 [2019-12-27 16:19:11,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:19:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-27 16:19:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-27 16:19:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-27 16:19:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-12-27 16:19:12,000 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 71 [2019-12-27 16:19:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:19:12,000 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-12-27 16:19:12,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:19:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-12-27 16:19:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 16:19:12,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:19:12,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:19:12,001 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:19:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:19:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-12-27 16:19:12,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:19:12,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112855488] [2019-12-27 16:19:12,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:19:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:19:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:19:12,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:19:12,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:19:12,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29|) 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 |v_ULTIMATE.start_main_~#t599~0.offset_21|) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t599~0.base_29|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t599~0.base_29|) |v_ULTIMATE.start_main_~#t599~0.offset_21| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t599~0.base_29| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t599~0.base_29| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_29|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t599~0.base=|v_ULTIMATE.start_main_~#t599~0.base_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ULTIMATE.start_main_~#t599~0.offset=|v_ULTIMATE.start_main_~#t599~0.offset_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t600~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t600~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t599~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t599~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 16:19:12,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t600~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t600~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t600~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t600~0.base_13|) |v_ULTIMATE.start_main_~#t600~0.offset_11| 1))) (= |v_ULTIMATE.start_main_~#t600~0.offset_11| 0) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13| 1)) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t600~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t600~0.offset=|v_ULTIMATE.start_main_~#t600~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t600~0.base=|v_ULTIMATE.start_main_~#t600~0.base_13|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t600~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t600~0.base, #length] because there is no mapped edge [2019-12-27 16:19:12,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 0 (mod v_~x$w_buff1_used~0_77 256)) (= 2 v_~x$w_buff0~0_34) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 16:19:12,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1854764737 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out1854764737| |P1Thread1of1ForFork1_#t~ite12_Out1854764737|)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1854764737 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1854764737| ~x$w_buff1~0_In1854764737) .cse0 (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1854764737| ~x$w_buff0~0_In1854764737) (not .cse2) .cse0 (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1854764737, ~x$w_buff1~0=~x$w_buff1~0_In1854764737, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1854764737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1854764737} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1854764737, ~x$w_buff1~0=~x$w_buff1~0_In1854764737, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1854764737|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1854764737|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1854764737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1854764737} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 16:19:12,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 16:19:12,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-2124578964 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-2124578964| ~x~0_In-2124578964) .cse0) (and (= ~x$mem_tmp~0_In-2124578964 |P1Thread1of1ForFork1_#t~ite31_Out-2124578964|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-2124578964, ~x$mem_tmp~0=~x$mem_tmp~0_In-2124578964, ~x~0=~x~0_In-2124578964} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-2124578964, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-2124578964|, ~x$mem_tmp~0=~x$mem_tmp~0_In-2124578964, ~x~0=~x~0_In-2124578964} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:19:12,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In124111875 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out124111875| |P0Thread1of1ForFork0_#t~ite3_Out124111875|)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In124111875 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out124111875| ~x~0_In124111875) .cse2) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out124111875| ~x$w_buff1~0_In124111875) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In124111875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In124111875, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In124111875, ~x~0=~x~0_In124111875} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out124111875|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out124111875|, ~x$w_buff1~0=~x$w_buff1~0_In124111875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In124111875, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In124111875, ~x~0=~x~0_In124111875} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 16:19:12,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In1194779525 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1194779525 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1194779525 |P0Thread1of1ForFork0_#t~ite5_Out1194779525|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1194779525|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1194779525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1194779525} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1194779525|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1194779525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1194779525} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 16:19:12,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2030501666 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2030501666 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-2030501666| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2030501666 |P1Thread1of1ForFork1_#t~ite34_Out-2030501666|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2030501666, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2030501666} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2030501666|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2030501666, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2030501666} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 16:19:12,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1242341902 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1242341902 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1242341902 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1242341902 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1242341902| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1242341902| ~x$w_buff1_used~0_In1242341902) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1242341902, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1242341902, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1242341902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1242341902} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1242341902, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1242341902, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1242341902|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1242341902, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1242341902} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 16:19:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In418714895 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In418714895 256)))) (or (and (= ~x$r_buff0_thd2~0_Out418714895 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In418714895 ~x$r_buff0_thd2~0_Out418714895) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In418714895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418714895} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out418714895, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out418714895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418714895} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 16:19:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In527359251 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In527359251 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In527359251 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In527359251 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out527359251|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In527359251 |P1Thread1of1ForFork1_#t~ite37_Out527359251|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In527359251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In527359251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527359251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527359251} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In527359251, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In527359251, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527359251, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out527359251|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527359251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:19:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 16:19:12,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2064054061 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2064054061 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In2064054061 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In2064054061 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2064054061| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out2064054061| ~x$w_buff1_used~0_In2064054061)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2064054061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2064054061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2064054061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2064054061} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2064054061|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2064054061, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2064054061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2064054061, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2064054061} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 16:19:12,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In92861970 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In92861970 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In92861970 |P0Thread1of1ForFork0_#t~ite7_Out92861970|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out92861970|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In92861970, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92861970} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In92861970, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out92861970|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In92861970} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 16:19:12,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In690480242 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In690480242 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In690480242 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In690480242 256)))) (or (and (= ~x$r_buff1_thd1~0_In690480242 |P0Thread1of1ForFork0_#t~ite8_Out690480242|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out690480242|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In690480242, ~x$w_buff1_used~0=~x$w_buff1_used~0_In690480242, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In690480242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690480242} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In690480242, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out690480242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In690480242, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In690480242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In690480242} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 16:19:12,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 16:19:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:19:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1512437507 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1512437507 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-1512437507| ~x$w_buff1~0_In-1512437507)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1512437507| ~x~0_In-1512437507) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1512437507, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1512437507, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1512437507, ~x~0=~x~0_In-1512437507} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1512437507|, ~x$w_buff1~0=~x$w_buff1~0_In-1512437507, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1512437507, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1512437507, ~x~0=~x~0_In-1512437507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 16:19:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 16:19:12,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In203356761 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In203356761 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out203356761| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In203356761 |ULTIMATE.start_main_#t~ite42_Out203356761|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In203356761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203356761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In203356761, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out203356761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In203356761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:19:12,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-202136076 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-202136076 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-202136076 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-202136076 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-202136076|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-202136076 |ULTIMATE.start_main_#t~ite43_Out-202136076|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-202136076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-202136076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-202136076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202136076} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-202136076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-202136076, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-202136076|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-202136076, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-202136076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 16:19:12,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1368333492 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1368333492 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1368333492| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1368333492| ~x$r_buff0_thd0~0_In1368333492) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1368333492, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368333492} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1368333492, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1368333492|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1368333492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:19:12,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In417412591 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In417412591 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In417412591 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In417412591 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out417412591| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In417412591 |ULTIMATE.start_main_#t~ite45_Out417412591|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In417412591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417412591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In417412591, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417412591} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In417412591, ~x$w_buff1_used~0=~x$w_buff1_used~0_In417412591, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In417412591, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out417412591|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In417412591} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:19:12,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1493022409 256)))) (or (and .cse0 (= ~x~0_In-1493022409 |ULTIMATE.start_main_#t~ite68_Out-1493022409|)) (and (= ~x$mem_tmp~0_In-1493022409 |ULTIMATE.start_main_#t~ite68_Out-1493022409|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1493022409, ~x$mem_tmp~0=~x$mem_tmp~0_In-1493022409, ~x~0=~x~0_In-1493022409} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1493022409, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1493022409|, ~x$mem_tmp~0=~x$mem_tmp~0_In-1493022409, ~x~0=~x~0_In-1493022409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 16:19:12,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:19:12,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:19:12 BasicIcfg [2019-12-27 16:19:12,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:19:12,257 INFO L168 Benchmark]: Toolchain (without parser) took 33880.39 ms. Allocated memory was 137.9 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.7 MB in the beginning and 633.2 MB in the end (delta: -533.5 MB). Peak memory consumption was 934.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,259 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.72 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,261 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,261 INFO L168 Benchmark]: RCFGBuilder took 927.00 ms. Allocated memory is still 202.9 MB. Free memory was 149.4 MB in the beginning and 94.1 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,265 INFO L168 Benchmark]: TraceAbstraction took 32064.80 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.4 MB in the beginning and 633.2 MB in the end (delta: -539.9 MB). Peak memory consumption was 862.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:19:12,272 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.20 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.72 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 99.5 MB in the beginning and 155.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.5 MB in the beginning and 152.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 927.00 ms. Allocated memory is still 202.9 MB. Free memory was 149.4 MB in the beginning and 94.1 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32064.80 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.4 MB in the beginning and 633.2 MB in the end (delta: -539.9 MB). Peak memory consumption was 862.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t599, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t600, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3053 SDtfs, 3362 SDslu, 6445 SDs, 0 SdLazy, 4014 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 44 SyntacticMatches, 30 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 26008 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 113298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...