/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:31:47,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:31:47,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:31:47,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:31:47,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:31:47,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:31:47,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:31:47,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:31:47,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:31:47,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:31:47,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:31:47,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:31:47,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:31:47,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:31:47,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:31:47,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:31:47,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:31:47,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:31:47,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:31:47,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:31:47,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:31:47,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:31:47,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:31:47,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:31:47,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:31:47,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:31:47,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:31:47,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:31:47,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:31:47,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:31:47,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:31:47,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:31:47,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:31:47,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:31:47,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:31:47,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:31:47,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:31:47,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:31:47,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:31:47,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:31:47,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:31:47,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:31:47,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:31:47,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:31:47,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:31:47,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:31:47,293 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:31:47,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:31:47,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:31:47,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:31:47,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:31:47,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:31:47,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:31:47,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:31:47,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:31:47,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:31:47,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:31:47,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:31:47,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:31:47,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:31:47,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:31:47,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:31:47,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:31:47,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:31:47,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:31:47,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:31:47,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:31:47,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:31:47,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:31:47,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:31:47,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:31:47,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:31:47,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:31:47,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:31:47,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:31:47,600 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:31:47,600 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:31:47,601 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2019-12-18 14:31:47,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a23a7aa/5057ceee48af4c80995b782415ec2fc6/FLAGeab3d3cfc [2019-12-18 14:31:48,235 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:31:48,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2019-12-18 14:31:48,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a23a7aa/5057ceee48af4c80995b782415ec2fc6/FLAGeab3d3cfc [2019-12-18 14:31:48,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a23a7aa/5057ceee48af4c80995b782415ec2fc6 [2019-12-18 14:31:48,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:31:48,504 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:31:48,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:31:48,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:31:48,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:31:48,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:31:48" (1/1) ... [2019-12-18 14:31:48,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:48, skipping insertion in model container [2019-12-18 14:31:48,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:31:48" (1/1) ... [2019-12-18 14:31:48,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:31:48,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:31:49,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:31:49,165 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:31:49,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:31:49,308 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:31:49,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49 WrapperNode [2019-12-18 14:31:49,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:31:49,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:31:49,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:31:49,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:31:49,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:31:49,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:31:49,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:31:49,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:31:49,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (1/1) ... [2019-12-18 14:31:49,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:31:49,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:31:49,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:31:49,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:31:49,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (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-18 14:31:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:31:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:31:49,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:31:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:31:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:31:49,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:31:49,500 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:31:49,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:31:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:31:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:31:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:31:49,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:31:49,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:31:49,503 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:31:50,247 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:31:50,247 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:31:50,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:31:50 BoogieIcfgContainer [2019-12-18 14:31:50,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:31:50,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:31:50,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:31:50,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:31:50,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:31:48" (1/3) ... [2019-12-18 14:31:50,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68074687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:31:50, skipping insertion in model container [2019-12-18 14:31:50,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:31:49" (2/3) ... [2019-12-18 14:31:50,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68074687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:31:50, skipping insertion in model container [2019-12-18 14:31:50,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:31:50" (3/3) ... [2019-12-18 14:31:50,264 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_rmo.opt.i [2019-12-18 14:31:50,272 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:31:50,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:31:50,285 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:31:50,286 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:31:50,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,325 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,326 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,377 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,387 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,397 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:31:50,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:31:50,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:31:50,437 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:31:50,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:31:50,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:31:50,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:31:50,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:31:50,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:31:50,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:31:50,455 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 14:31:50,457 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:31:50,538 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:31:50,538 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:31:50,556 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:31:50,583 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 14:31:50,627 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 14:31:50,627 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:31:50,637 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:31:50,661 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 14:31:50,663 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:31:55,605 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-18 14:31:56,335 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:31:56,459 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:31:56,588 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-18 14:31:56,588 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 14:31:56,591 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:32:08,007 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-18 14:32:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-18 14:32:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:32:08,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:08,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:32:08,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:08,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-18 14:32:08,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:08,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719237050] [2019-12-18 14:32:08,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:08,234 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-18 14:32:08,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719237050] [2019-12-18 14:32:08,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:08,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:32:08,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061897140] [2019-12-18 14:32:08,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:08,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:08,255 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-18 14:32:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:09,314 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-18 14:32:09,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:09,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:32:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:12,333 INFO L225 Difference]: With dead ends: 85012 [2019-12-18 14:32:12,333 INFO L226 Difference]: Without dead ends: 80140 [2019-12-18 14:32:12,334 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-18 14:32:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-18 14:32:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-18 14:32:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-18 14:32:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-18 14:32:17,908 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-18 14:32:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:17,909 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-18 14:32:17,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-18 14:32:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:32:17,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:17,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:17,918 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-18 14:32:17,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:17,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608855876] [2019-12-18 14:32:17,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:18,052 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-18 14:32:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608855876] [2019-12-18 14:32:18,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:18,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:18,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842326721] [2019-12-18 14:32:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:18,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:18,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:18,057 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-18 14:32:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:22,936 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-18 14:32:22,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:22,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:32:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:23,495 INFO L225 Difference]: With dead ends: 123388 [2019-12-18 14:32:23,496 INFO L226 Difference]: Without dead ends: 123290 [2019-12-18 14:32:23,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-18 14:32:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-18 14:32:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-18 14:32:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-18 14:32:30,058 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-18 14:32:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:30,059 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-18 14:32:30,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-18 14:32:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:32:30,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:30,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:30,064 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:30,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:30,064 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-18 14:32:30,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:30,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135720231] [2019-12-18 14:32:30,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:30,157 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-18 14:32:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135720231] [2019-12-18 14:32:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:30,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100409008] [2019-12-18 14:32:30,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:30,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:30,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:30,160 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-18 14:32:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:30,355 INFO L93 Difference]: Finished difference Result 36525 states and 128382 transitions. [2019-12-18 14:32:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:32:30,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:32:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:30,411 INFO L225 Difference]: With dead ends: 36525 [2019-12-18 14:32:30,412 INFO L226 Difference]: Without dead ends: 28771 [2019-12-18 14:32:30,412 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-18 14:32:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28771 states. [2019-12-18 14:32:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28771 to 28723. [2019-12-18 14:32:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28723 states. [2019-12-18 14:32:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 97157 transitions. [2019-12-18 14:32:30,976 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 97157 transitions. Word has length 13 [2019-12-18 14:32:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:30,976 INFO L462 AbstractCegarLoop]: Abstraction has 28723 states and 97157 transitions. [2019-12-18 14:32:30,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 97157 transitions. [2019-12-18 14:32:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:30,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:30,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:30,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:30,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-18 14:32:30,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:30,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173123941] [2019-12-18 14:32:30,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:32:31,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173123941] [2019-12-18 14:32:31,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:31,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:31,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835035160] [2019-12-18 14:32:31,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:31,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:31,059 INFO L87 Difference]: Start difference. First operand 28723 states and 97157 transitions. Second operand 3 states. [2019-12-18 14:32:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:31,272 INFO L93 Difference]: Finished difference Result 42081 states and 141205 transitions. [2019-12-18 14:32:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:31,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:32:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:31,355 INFO L225 Difference]: With dead ends: 42081 [2019-12-18 14:32:31,355 INFO L226 Difference]: Without dead ends: 42081 [2019-12-18 14:32:31,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42081 states. [2019-12-18 14:32:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42081 to 32226. [2019-12-18 14:32:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32226 states. [2019-12-18 14:32:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32226 states to 32226 states and 107932 transitions. [2019-12-18 14:32:34,077 INFO L78 Accepts]: Start accepts. Automaton has 32226 states and 107932 transitions. Word has length 14 [2019-12-18 14:32:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:34,078 INFO L462 AbstractCegarLoop]: Abstraction has 32226 states and 107932 transitions. [2019-12-18 14:32:34,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32226 states and 107932 transitions. [2019-12-18 14:32:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:34,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:34,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:34,080 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-18 14:32:34,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:34,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940175819] [2019-12-18 14:32:34,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:34,166 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-18 14:32:34,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940175819] [2019-12-18 14:32:34,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:34,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:34,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364797641] [2019-12-18 14:32:34,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:34,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:34,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:34,169 INFO L87 Difference]: Start difference. First operand 32226 states and 107932 transitions. Second operand 4 states. [2019-12-18 14:32:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:34,518 INFO L93 Difference]: Finished difference Result 39611 states and 130690 transitions. [2019-12-18 14:32:34,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:34,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:32:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:34,593 INFO L225 Difference]: With dead ends: 39611 [2019-12-18 14:32:34,594 INFO L226 Difference]: Without dead ends: 39522 [2019-12-18 14:32:34,594 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-18 14:32:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39522 states. [2019-12-18 14:32:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39522 to 34698. [2019-12-18 14:32:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34698 states. [2019-12-18 14:32:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34698 states to 34698 states and 115782 transitions. [2019-12-18 14:32:35,256 INFO L78 Accepts]: Start accepts. Automaton has 34698 states and 115782 transitions. Word has length 14 [2019-12-18 14:32:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:35,257 INFO L462 AbstractCegarLoop]: Abstraction has 34698 states and 115782 transitions. [2019-12-18 14:32:35,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 34698 states and 115782 transitions. [2019-12-18 14:32:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:32:35,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:35,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:35,259 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:35,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-18 14:32:35,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:35,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495228987] [2019-12-18 14:32:35,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:35,330 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-18 14:32:35,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495228987] [2019-12-18 14:32:35,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:35,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:35,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299174313] [2019-12-18 14:32:35,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:35,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:35,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:35,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:35,333 INFO L87 Difference]: Start difference. First operand 34698 states and 115782 transitions. Second operand 4 states. [2019-12-18 14:32:36,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:36,106 INFO L93 Difference]: Finished difference Result 42436 states and 139747 transitions. [2019-12-18 14:32:36,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:36,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:32:36,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:36,179 INFO L225 Difference]: With dead ends: 42436 [2019-12-18 14:32:36,179 INFO L226 Difference]: Without dead ends: 42329 [2019-12-18 14:32:36,180 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-18 14:32:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42329 states. [2019-12-18 14:32:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42329 to 36027. [2019-12-18 14:32:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36027 states. [2019-12-18 14:32:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36027 states to 36027 states and 119643 transitions. [2019-12-18 14:32:36,793 INFO L78 Accepts]: Start accepts. Automaton has 36027 states and 119643 transitions. Word has length 14 [2019-12-18 14:32:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:36,794 INFO L462 AbstractCegarLoop]: Abstraction has 36027 states and 119643 transitions. [2019-12-18 14:32:36,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36027 states and 119643 transitions. [2019-12-18 14:32:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:32:36,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:36,806 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] [2019-12-18 14:32:36,806 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-18 14:32:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711393800] [2019-12-18 14:32:36,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:36,954 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-18 14:32:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711393800] [2019-12-18 14:32:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612686894] [2019-12-18 14:32:36,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:36,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:36,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:36,956 INFO L87 Difference]: Start difference. First operand 36027 states and 119643 transitions. Second operand 5 states. [2019-12-18 14:32:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:37,587 INFO L93 Difference]: Finished difference Result 48205 states and 157671 transitions. [2019-12-18 14:32:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:32:37,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:32:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:37,666 INFO L225 Difference]: With dead ends: 48205 [2019-12-18 14:32:37,666 INFO L226 Difference]: Without dead ends: 48029 [2019-12-18 14:32:37,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48029 states. [2019-12-18 14:32:38,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48029 to 36780. [2019-12-18 14:32:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36780 states. [2019-12-18 14:32:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 122127 transitions. [2019-12-18 14:32:38,935 INFO L78 Accepts]: Start accepts. Automaton has 36780 states and 122127 transitions. Word has length 22 [2019-12-18 14:32:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:38,936 INFO L462 AbstractCegarLoop]: Abstraction has 36780 states and 122127 transitions. [2019-12-18 14:32:38,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:32:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36780 states and 122127 transitions. [2019-12-18 14:32:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:32:38,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:38,946 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] [2019-12-18 14:32:38,947 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-18 14:32:38,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:38,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121500894] [2019-12-18 14:32:38,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:39,075 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-18 14:32:39,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121500894] [2019-12-18 14:32:39,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:39,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:39,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949053893] [2019-12-18 14:32:39,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:39,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:39,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:39,078 INFO L87 Difference]: Start difference. First operand 36780 states and 122127 transitions. Second operand 5 states. [2019-12-18 14:32:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:39,670 INFO L93 Difference]: Finished difference Result 49034 states and 160234 transitions. [2019-12-18 14:32:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:32:39,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 14:32:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:39,758 INFO L225 Difference]: With dead ends: 49034 [2019-12-18 14:32:39,758 INFO L226 Difference]: Without dead ends: 48752 [2019-12-18 14:32:39,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48752 states. [2019-12-18 14:32:40,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48752 to 34955. [2019-12-18 14:32:40,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34955 states. [2019-12-18 14:32:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34955 states to 34955 states and 116069 transitions. [2019-12-18 14:32:40,464 INFO L78 Accepts]: Start accepts. Automaton has 34955 states and 116069 transitions. Word has length 22 [2019-12-18 14:32:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:40,464 INFO L462 AbstractCegarLoop]: Abstraction has 34955 states and 116069 transitions. [2019-12-18 14:32:40,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:32:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 34955 states and 116069 transitions. [2019-12-18 14:32:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:32:40,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:40,476 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-18 14:32:40,476 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-18 14:32:40,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:40,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494875394] [2019-12-18 14:32:40,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:40,679 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-18 14:32:40,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494875394] [2019-12-18 14:32:40,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:40,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:32:40,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094717605] [2019-12-18 14:32:40,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:32:40,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:40,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:32:40,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:32:40,683 INFO L87 Difference]: Start difference. First operand 34955 states and 116069 transitions. Second operand 7 states. [2019-12-18 14:32:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:41,249 INFO L93 Difference]: Finished difference Result 48013 states and 156239 transitions. [2019-12-18 14:32:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:32:41,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 14:32:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:41,330 INFO L225 Difference]: With dead ends: 48013 [2019-12-18 14:32:41,330 INFO L226 Difference]: Without dead ends: 47985 [2019-12-18 14:32:41,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:41,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47985 states. [2019-12-18 14:32:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47985 to 39324. [2019-12-18 14:32:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39324 states. [2019-12-18 14:32:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39324 states to 39324 states and 129687 transitions. [2019-12-18 14:32:42,304 INFO L78 Accepts]: Start accepts. Automaton has 39324 states and 129687 transitions. Word has length 25 [2019-12-18 14:32:42,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:42,304 INFO L462 AbstractCegarLoop]: Abstraction has 39324 states and 129687 transitions. [2019-12-18 14:32:42,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:32:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 39324 states and 129687 transitions. [2019-12-18 14:32:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:32:42,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:42,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:32:42,321 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:42,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-18 14:32:42,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:42,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445305311] [2019-12-18 14:32:42,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:42,395 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-18 14:32:42,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445305311] [2019-12-18 14:32:42,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:42,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:32:42,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492571137] [2019-12-18 14:32:42,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:32:42,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:42,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:32:42,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:42,397 INFO L87 Difference]: Start difference. First operand 39324 states and 129687 transitions. Second operand 5 states. [2019-12-18 14:32:42,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:42,498 INFO L93 Difference]: Finished difference Result 17735 states and 54519 transitions. [2019-12-18 14:32:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:32:42,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:32:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:42,520 INFO L225 Difference]: With dead ends: 17735 [2019-12-18 14:32:42,520 INFO L226 Difference]: Without dead ends: 15148 [2019-12-18 14:32:42,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:32:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15148 states. [2019-12-18 14:32:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15148 to 14734. [2019-12-18 14:32:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14734 states. [2019-12-18 14:32:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14734 states to 14734 states and 44987 transitions. [2019-12-18 14:32:42,730 INFO L78 Accepts]: Start accepts. Automaton has 14734 states and 44987 transitions. Word has length 28 [2019-12-18 14:32:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:42,731 INFO L462 AbstractCegarLoop]: Abstraction has 14734 states and 44987 transitions. [2019-12-18 14:32:42,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:32:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 14734 states and 44987 transitions. [2019-12-18 14:32:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:32:42,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:42,751 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] [2019-12-18 14:32:42,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:42,752 INFO L82 PathProgramCache]: Analyzing trace with hash -672186652, now seen corresponding path program 1 times [2019-12-18 14:32:42,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:42,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539321925] [2019-12-18 14:32:42,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:42,828 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-18 14:32:42,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539321925] [2019-12-18 14:32:42,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:42,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:42,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886554886] [2019-12-18 14:32:42,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:32:42,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:42,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:32:42,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:32:42,831 INFO L87 Difference]: Start difference. First operand 14734 states and 44987 transitions. Second operand 4 states. [2019-12-18 14:32:42,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:42,974 INFO L93 Difference]: Finished difference Result 27256 states and 83136 transitions. [2019-12-18 14:32:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:32:42,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 14:32:42,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:43,011 INFO L225 Difference]: With dead ends: 27256 [2019-12-18 14:32:43,012 INFO L226 Difference]: Without dead ends: 14949 [2019-12-18 14:32:43,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:32:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14949 states. [2019-12-18 14:32:43,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14949 to 14933. [2019-12-18 14:32:43,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14933 states. [2019-12-18 14:32:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14933 states to 14933 states and 45288 transitions. [2019-12-18 14:32:43,376 INFO L78 Accepts]: Start accepts. Automaton has 14933 states and 45288 transitions. Word has length 39 [2019-12-18 14:32:43,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:43,378 INFO L462 AbstractCegarLoop]: Abstraction has 14933 states and 45288 transitions. [2019-12-18 14:32:43,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:32:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14933 states and 45288 transitions. [2019-12-18 14:32:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:32:43,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:43,410 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] [2019-12-18 14:32:43,411 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1438865066, now seen corresponding path program 2 times [2019-12-18 14:32:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:43,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883309277] [2019-12-18 14:32:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:43,503 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-18 14:32:43,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883309277] [2019-12-18 14:32:43,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:43,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:43,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749508936] [2019-12-18 14:32:43,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:43,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:43,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:43,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:43,505 INFO L87 Difference]: Start difference. First operand 14933 states and 45288 transitions. Second operand 3 states. [2019-12-18 14:32:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:43,609 INFO L93 Difference]: Finished difference Result 21692 states and 66881 transitions. [2019-12-18 14:32:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:43,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:32:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:43,628 INFO L225 Difference]: With dead ends: 21692 [2019-12-18 14:32:43,628 INFO L226 Difference]: Without dead ends: 9192 [2019-12-18 14:32:43,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9192 states. [2019-12-18 14:32:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9192 to 9081. [2019-12-18 14:32:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9081 states. [2019-12-18 14:32:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9081 states to 9081 states and 27158 transitions. [2019-12-18 14:32:43,772 INFO L78 Accepts]: Start accepts. Automaton has 9081 states and 27158 transitions. Word has length 39 [2019-12-18 14:32:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:43,772 INFO L462 AbstractCegarLoop]: Abstraction has 9081 states and 27158 transitions. [2019-12-18 14:32:43,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9081 states and 27158 transitions. [2019-12-18 14:32:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:32:43,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:43,785 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] [2019-12-18 14:32:43,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-18 14:32:43,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:43,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956402249] [2019-12-18 14:32:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:43,987 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-18 14:32:43,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956402249] [2019-12-18 14:32:43,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:43,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:32:43,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486827068] [2019-12-18 14:32:43,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:32:43,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:32:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:32:43,990 INFO L87 Difference]: Start difference. First operand 9081 states and 27158 transitions. Second operand 8 states. [2019-12-18 14:32:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:44,581 INFO L93 Difference]: Finished difference Result 9522 states and 28123 transitions. [2019-12-18 14:32:44,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:32:44,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-18 14:32:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:44,598 INFO L225 Difference]: With dead ends: 9522 [2019-12-18 14:32:44,598 INFO L226 Difference]: Without dead ends: 9354 [2019-12-18 14:32:44,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:32:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9354 states. [2019-12-18 14:32:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9354 to 9063. [2019-12-18 14:32:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9063 states. [2019-12-18 14:32:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9063 states to 9063 states and 27129 transitions. [2019-12-18 14:32:44,727 INFO L78 Accepts]: Start accepts. Automaton has 9063 states and 27129 transitions. Word has length 40 [2019-12-18 14:32:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:44,727 INFO L462 AbstractCegarLoop]: Abstraction has 9063 states and 27129 transitions. [2019-12-18 14:32:44,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:32:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9063 states and 27129 transitions. [2019-12-18 14:32:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:32:44,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:44,738 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] [2019-12-18 14:32:44,738 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1884333106, now seen corresponding path program 1 times [2019-12-18 14:32:44,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:44,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834211544] [2019-12-18 14:32:44,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:44,783 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-18 14:32:44,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834211544] [2019-12-18 14:32:44,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:44,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:32:44,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031353673] [2019-12-18 14:32:44,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:44,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:44,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:44,785 INFO L87 Difference]: Start difference. First operand 9063 states and 27129 transitions. Second operand 3 states. [2019-12-18 14:32:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:44,856 INFO L93 Difference]: Finished difference Result 11257 states and 32864 transitions. [2019-12-18 14:32:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:44,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 14:32:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:44,877 INFO L225 Difference]: With dead ends: 11257 [2019-12-18 14:32:44,878 INFO L226 Difference]: Without dead ends: 11257 [2019-12-18 14:32:44,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2019-12-18 14:32:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 9472. [2019-12-18 14:32:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9472 states. [2019-12-18 14:32:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 27992 transitions. [2019-12-18 14:32:45,148 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 27992 transitions. Word has length 40 [2019-12-18 14:32:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:45,148 INFO L462 AbstractCegarLoop]: Abstraction has 9472 states and 27992 transitions. [2019-12-18 14:32:45,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 27992 transitions. [2019-12-18 14:32:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:32:45,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:45,163 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] [2019-12-18 14:32:45,164 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-18 14:32:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:45,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925257751] [2019-12-18 14:32:45,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:45,235 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-18 14:32:45,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925257751] [2019-12-18 14:32:45,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:45,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:45,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083357204] [2019-12-18 14:32:45,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:45,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:45,237 INFO L87 Difference]: Start difference. First operand 9472 states and 27992 transitions. Second operand 3 states. [2019-12-18 14:32:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:45,297 INFO L93 Difference]: Finished difference Result 8994 states and 26058 transitions. [2019-12-18 14:32:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:45,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 14:32:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:45,315 INFO L225 Difference]: With dead ends: 8994 [2019-12-18 14:32:45,315 INFO L226 Difference]: Without dead ends: 8994 [2019-12-18 14:32:45,317 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-18 14:32:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8994 states. [2019-12-18 14:32:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8994 to 8994. [2019-12-18 14:32:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8994 states. [2019-12-18 14:32:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8994 states to 8994 states and 26058 transitions. [2019-12-18 14:32:45,590 INFO L78 Accepts]: Start accepts. Automaton has 8994 states and 26058 transitions. Word has length 40 [2019-12-18 14:32:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:45,590 INFO L462 AbstractCegarLoop]: Abstraction has 8994 states and 26058 transitions. [2019-12-18 14:32:45,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 8994 states and 26058 transitions. [2019-12-18 14:32:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:32:45,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:45,603 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] [2019-12-18 14:32:45,603 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-18 14:32:45,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:45,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089364786] [2019-12-18 14:32:45,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:45,718 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-18 14:32:45,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089364786] [2019-12-18 14:32:45,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:45,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:32:45,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254192282] [2019-12-18 14:32:45,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:32:45,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:45,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:32:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:32:45,721 INFO L87 Difference]: Start difference. First operand 8994 states and 26058 transitions. Second operand 6 states. [2019-12-18 14:32:46,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:46,093 INFO L93 Difference]: Finished difference Result 9245 states and 26586 transitions. [2019-12-18 14:32:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:32:46,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:32:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:46,106 INFO L225 Difference]: With dead ends: 9245 [2019-12-18 14:32:46,106 INFO L226 Difference]: Without dead ends: 8993 [2019-12-18 14:32:46,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:32:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2019-12-18 14:32:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8404. [2019-12-18 14:32:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8404 states. [2019-12-18 14:32:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8404 states to 8404 states and 24788 transitions. [2019-12-18 14:32:46,225 INFO L78 Accepts]: Start accepts. Automaton has 8404 states and 24788 transitions. Word has length 41 [2019-12-18 14:32:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:46,226 INFO L462 AbstractCegarLoop]: Abstraction has 8404 states and 24788 transitions. [2019-12-18 14:32:46,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:32:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8404 states and 24788 transitions. [2019-12-18 14:32:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:32:46,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:46,236 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] [2019-12-18 14:32:46,236 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:46,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:46,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1212552046, now seen corresponding path program 1 times [2019-12-18 14:32:46,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:46,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249874577] [2019-12-18 14:32:46,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:46,307 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-18 14:32:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249874577] [2019-12-18 14:32:46,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:46,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:32:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114561767] [2019-12-18 14:32:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:32:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:32:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:32:46,309 INFO L87 Difference]: Start difference. First operand 8404 states and 24788 transitions. Second operand 3 states. [2019-12-18 14:32:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:46,348 INFO L93 Difference]: Finished difference Result 8322 states and 24510 transitions. [2019-12-18 14:32:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:32:46,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:32:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:46,363 INFO L225 Difference]: With dead ends: 8322 [2019-12-18 14:32:46,363 INFO L226 Difference]: Without dead ends: 8322 [2019-12-18 14:32:46,364 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-18 14:32:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-18 14:32:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 8322. [2019-12-18 14:32:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8322 states. [2019-12-18 14:32:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8322 states to 8322 states and 24510 transitions. [2019-12-18 14:32:46,498 INFO L78 Accepts]: Start accepts. Automaton has 8322 states and 24510 transitions. Word has length 41 [2019-12-18 14:32:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:46,498 INFO L462 AbstractCegarLoop]: Abstraction has 8322 states and 24510 transitions. [2019-12-18 14:32:46,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:32:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8322 states and 24510 transitions. [2019-12-18 14:32:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:32:46,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:46,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] [2019-12-18 14:32:46,508 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1119333898, now seen corresponding path program 1 times [2019-12-18 14:32:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:46,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868592620] [2019-12-18 14:32:46,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:46,586 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-18 14:32:46,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868592620] [2019-12-18 14:32:46,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:46,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:32:46,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710543697] [2019-12-18 14:32:46,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:32:46,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:32:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:32:46,588 INFO L87 Difference]: Start difference. First operand 8322 states and 24510 transitions. Second operand 6 states. [2019-12-18 14:32:46,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:46,703 INFO L93 Difference]: Finished difference Result 7401 states and 22300 transitions. [2019-12-18 14:32:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:32:46,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 14:32:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:46,714 INFO L225 Difference]: With dead ends: 7401 [2019-12-18 14:32:46,714 INFO L226 Difference]: Without dead ends: 5974 [2019-12-18 14:32:46,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2019-12-18 14:32:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 5974. [2019-12-18 14:32:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5974 states. [2019-12-18 14:32:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5974 states to 5974 states and 18959 transitions. [2019-12-18 14:32:46,810 INFO L78 Accepts]: Start accepts. Automaton has 5974 states and 18959 transitions. Word has length 42 [2019-12-18 14:32:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:46,811 INFO L462 AbstractCegarLoop]: Abstraction has 5974 states and 18959 transitions. [2019-12-18 14:32:46,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:32:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5974 states and 18959 transitions. [2019-12-18 14:32:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:32:46,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:46,818 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] [2019-12-18 14:32:46,818 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:46,819 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 1 times [2019-12-18 14:32:46,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:46,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471880333] [2019-12-18 14:32:46,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:46,934 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-18 14:32:46,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471880333] [2019-12-18 14:32:46,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:46,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:32:46,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637857048] [2019-12-18 14:32:46,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:32:46,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:32:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:32:46,936 INFO L87 Difference]: Start difference. First operand 5974 states and 18959 transitions. Second operand 9 states. [2019-12-18 14:32:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:47,912 INFO L93 Difference]: Finished difference Result 12118 states and 37637 transitions. [2019-12-18 14:32:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:32:47,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-18 14:32:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:47,929 INFO L225 Difference]: With dead ends: 12118 [2019-12-18 14:32:47,930 INFO L226 Difference]: Without dead ends: 8658 [2019-12-18 14:32:47,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:32:47,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8658 states. [2019-12-18 14:32:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8658 to 8132. [2019-12-18 14:32:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8132 states. [2019-12-18 14:32:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 25263 transitions. [2019-12-18 14:32:48,064 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 25263 transitions. Word has length 56 [2019-12-18 14:32:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:48,064 INFO L462 AbstractCegarLoop]: Abstraction has 8132 states and 25263 transitions. [2019-12-18 14:32:48,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:32:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 25263 transitions. [2019-12-18 14:32:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:32:48,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:48,078 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] [2019-12-18 14:32:48,078 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:48,078 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 2 times [2019-12-18 14:32:48,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:48,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567184137] [2019-12-18 14:32:48,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:48,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-18 14:32:48,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567184137] [2019-12-18 14:32:48,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:48,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:32:48,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570444838] [2019-12-18 14:32:48,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:32:48,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:32:48,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:32:48,328 INFO L87 Difference]: Start difference. First operand 8132 states and 25263 transitions. Second operand 11 states. [2019-12-18 14:32:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:49,395 INFO L93 Difference]: Finished difference Result 13728 states and 41828 transitions. [2019-12-18 14:32:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:32:49,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 14:32:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:49,409 INFO L225 Difference]: With dead ends: 13728 [2019-12-18 14:32:49,410 INFO L226 Difference]: Without dead ends: 8612 [2019-12-18 14:32:49,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:32:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8612 states. [2019-12-18 14:32:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8612 to 7382. [2019-12-18 14:32:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7382 states. [2019-12-18 14:32:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7382 states to 7382 states and 22690 transitions. [2019-12-18 14:32:49,533 INFO L78 Accepts]: Start accepts. Automaton has 7382 states and 22690 transitions. Word has length 56 [2019-12-18 14:32:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:49,533 INFO L462 AbstractCegarLoop]: Abstraction has 7382 states and 22690 transitions. [2019-12-18 14:32:49,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:32:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7382 states and 22690 transitions. [2019-12-18 14:32:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:32:49,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:49,542 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] [2019-12-18 14:32:49,542 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 3 times [2019-12-18 14:32:49,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:49,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77269958] [2019-12-18 14:32:49,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:32:50,160 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-18 14:32:50,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77269958] [2019-12-18 14:32:50,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:32:50,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:32:50,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425625804] [2019-12-18 14:32:50,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:32:50,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:32:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:32:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:32:50,163 INFO L87 Difference]: Start difference. First operand 7382 states and 22690 transitions. Second operand 16 states. [2019-12-18 14:32:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:32:52,955 INFO L93 Difference]: Finished difference Result 10339 states and 30616 transitions. [2019-12-18 14:32:52,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 14:32:52,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 14:32:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:32:52,978 INFO L225 Difference]: With dead ends: 10339 [2019-12-18 14:32:52,979 INFO L226 Difference]: Without dead ends: 10013 [2019-12-18 14:32:52,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 14:32:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10013 states. [2019-12-18 14:32:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10013 to 8253. [2019-12-18 14:32:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8253 states. [2019-12-18 14:32:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8253 states to 8253 states and 25159 transitions. [2019-12-18 14:32:53,195 INFO L78 Accepts]: Start accepts. Automaton has 8253 states and 25159 transitions. Word has length 56 [2019-12-18 14:32:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:32:53,195 INFO L462 AbstractCegarLoop]: Abstraction has 8253 states and 25159 transitions. [2019-12-18 14:32:53,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:32:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 8253 states and 25159 transitions. [2019-12-18 14:32:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:32:53,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:32:53,204 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] [2019-12-18 14:32:53,204 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:32:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:32:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 4 times [2019-12-18 14:32:53,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:32:53,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156450164] [2019-12-18 14:32:53,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:32:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:32:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:32:53,326 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:32:53,326 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:32:53,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1912~0.base_26|) |v_ULTIMATE.start_main_~#t1912~0.offset_20| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26| 1)) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1912~0.base_26|) 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1912~0.base_26| 4)) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1912~0.base_26|) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= 0 |v_ULTIMATE.start_main_~#t1912~0.offset_20|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ULTIMATE.start_main_~#t1912~0.base=|v_ULTIMATE.start_main_~#t1912~0.base_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, ULTIMATE.start_main_~#t1912~0.offset=|v_ULTIMATE.start_main_~#t1912~0.offset_20|, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1913~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1914~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_~#t1912~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1912~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1914~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:32:53,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1913~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t1913~0.offset_9| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1913~0.base_10|) |v_ULTIMATE.start_main_~#t1913~0.offset_9| 1)) |v_#memory_int_15|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1913~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1913~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1913~0.base=|v_ULTIMATE.start_main_~#t1913~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1913~0.offset=|v_ULTIMATE.start_main_~#t1913~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1913~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1913~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 14:32:53,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:32:53,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1914~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1914~0.base_11|) |v_ULTIMATE.start_main_~#t1914~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1914~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t1914~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1914~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1914~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1914~0.base=|v_ULTIMATE.start_main_~#t1914~0.base_11|, ULTIMATE.start_main_~#t1914~0.offset=|v_ULTIMATE.start_main_~#t1914~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1914~0.base, ULTIMATE.start_main_~#t1914~0.offset] because there is no mapped edge [2019-12-18 14:32:53,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1219635677 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1219635677 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-1219635677| ~x~0_In-1219635677) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1219635677 |P2Thread1of1ForFork1_#t~ite32_Out-1219635677|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1219635677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1219635677, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1219635677, ~x~0=~x~0_In-1219635677} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1219635677|, ~x$w_buff1~0=~x$w_buff1~0_In-1219635677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1219635677, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1219635677, ~x~0=~x~0_In-1219635677} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:32:53,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 14:32:53,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1382585817 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1382585817 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-1382585817| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1382585817 |P2Thread1of1ForFork1_#t~ite34_Out-1382585817|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1382585817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382585817} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1382585817|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1382585817, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382585817} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:32:53,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In358440910 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In358440910 256)))) (or (and (= (mod ~x$r_buff1_thd1~0_In358440910 256) 0) .cse1) (and (= (mod ~x$w_buff1_used~0_In358440910 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In358440910 256) 0))) (= ~x$w_buff0~0_In358440910 |P0Thread1of1ForFork2_#t~ite8_Out358440910|) (= |P0Thread1of1ForFork2_#t~ite9_Out358440910| |P0Thread1of1ForFork2_#t~ite8_Out358440910|)) (and (not .cse0) (= ~x$w_buff0~0_In358440910 |P0Thread1of1ForFork2_#t~ite9_Out358440910|) (= |P0Thread1of1ForFork2_#t~ite8_In358440910| |P0Thread1of1ForFork2_#t~ite8_Out358440910|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In358440910, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In358440910, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In358440910|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In358440910, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In358440910, ~weak$$choice2~0=~weak$$choice2~0_In358440910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In358440910} OutVars{~x$w_buff0~0=~x$w_buff0~0_In358440910, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In358440910, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out358440910|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In358440910, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out358440910|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In358440910, ~weak$$choice2~0=~weak$$choice2~0_In358440910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In358440910} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 14:32:53,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1592003241 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1592003241 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1592003241|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1592003241 |P1Thread1of1ForFork0_#t~ite28_Out1592003241|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1592003241, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592003241} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1592003241, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1592003241|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1592003241} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:32:53,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1575017157 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1575017157 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1575017157 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1575017157 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out1575017157| ~x$w_buff1_used~0_In1575017157)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1575017157| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1575017157, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1575017157, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1575017157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1575017157} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1575017157, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1575017157, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1575017157, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1575017157|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1575017157} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:32:53,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1473176656 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1473176656 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1473176656 ~x$r_buff0_thd2~0_Out1473176656) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out1473176656) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1473176656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1473176656} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1473176656|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1473176656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1473176656} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:32:53,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-903747690 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-903747690 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-903747690 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-903747690 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-903747690| ~x$r_buff1_thd2~0_In-903747690)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-903747690| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-903747690, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-903747690, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-903747690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903747690} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-903747690|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-903747690, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-903747690, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-903747690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-903747690} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:32:53,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:32:53,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2109895297 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-2109895297 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-2109895297 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2109895297 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-2109895297| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-2109895297| ~x$w_buff1_used~0_In-2109895297) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2109895297, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2109895297, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2109895297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2109895297} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2109895297|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2109895297, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2109895297, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2109895297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2109895297} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:32:53,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-948077550 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-948077550 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-948077550|)) (and (= ~x$r_buff0_thd3~0_In-948077550 |P2Thread1of1ForFork1_#t~ite36_Out-948077550|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-948077550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948077550} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-948077550|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-948077550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-948077550} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:32:53,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1733743510 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1733743510| |P0Thread1of1ForFork2_#t~ite17_Out1733743510|) (= ~x$w_buff1_used~0_In1733743510 |P0Thread1of1ForFork2_#t~ite18_Out1733743510|)) (and (= ~x$w_buff1_used~0_In1733743510 |P0Thread1of1ForFork2_#t~ite17_Out1733743510|) .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out1733743510| |P0Thread1of1ForFork2_#t~ite18_Out1733743510|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1733743510 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1733743510 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1733743510 256) 0)) (and (= (mod ~x$w_buff1_used~0_In1733743510 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733743510, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1733743510|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733743510, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733743510, ~weak$$choice2~0=~weak$$choice2~0_In1733743510, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733743510} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1733743510, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1733743510|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1733743510|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1733743510, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1733743510, ~weak$$choice2~0=~weak$$choice2~0_In1733743510, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1733743510} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:32:53,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 14:32:53,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1024395512 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1024395512| ~x$r_buff1_thd1~0_In-1024395512) (= |P0Thread1of1ForFork2_#t~ite24_Out-1024395512| |P0Thread1of1ForFork2_#t~ite23_Out-1024395512|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1024395512 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1024395512 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1024395512 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1024395512 256)) .cse0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In-1024395512| |P0Thread1of1ForFork2_#t~ite23_Out-1024395512|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1024395512| ~x$r_buff1_thd1~0_In-1024395512) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1024395512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1024395512, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1024395512, ~weak$$choice2~0=~weak$$choice2~0_In-1024395512, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1024395512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1024395512} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1024395512, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1024395512, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1024395512, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1024395512|, ~weak$$choice2~0=~weak$$choice2~0_In-1024395512, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1024395512|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1024395512} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 14:32:53,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-641812528 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-641812528 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-641812528 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-641812528 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-641812528| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-641812528| ~x$r_buff1_thd3~0_In-641812528)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-641812528, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-641812528, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-641812528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641812528} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-641812528|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-641812528, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-641812528, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-641812528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641812528} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:32:53,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 14:32:53,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 14:32:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:32:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1002619602 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1002619602 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1002619602| ~x~0_In1002619602)) (and (= ~x$w_buff1~0_In1002619602 |ULTIMATE.start_main_#t~ite41_Out1002619602|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1002619602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1002619602, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1002619602, ~x~0=~x~0_In1002619602} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1002619602|, ~x$w_buff1~0=~x$w_buff1~0_In1002619602, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1002619602, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1002619602, ~x~0=~x~0_In1002619602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 14:32:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 14:32:53,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-979085919 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-979085919 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-979085919| ~x$w_buff0_used~0_In-979085919) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-979085919| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-979085919, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-979085919} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-979085919, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-979085919|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-979085919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:32:53,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd0~0_In-1926310860 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1926310860 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1926310860 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1926310860 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1926310860| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1926310860| ~x$w_buff1_used~0_In-1926310860)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1926310860, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1926310860, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1926310860, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1926310860} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1926310860, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1926310860, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1926310860, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1926310860|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1926310860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:32:53,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In175140756 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In175140756 256)))) (or (and (= ~x$r_buff0_thd0~0_In175140756 |ULTIMATE.start_main_#t~ite45_Out175140756|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out175140756| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In175140756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175140756} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In175140756, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out175140756|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In175140756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:32:53,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-2133030858 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-2133030858 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-2133030858 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2133030858 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-2133030858|)) (and (= ~x$r_buff1_thd0~0_In-2133030858 |ULTIMATE.start_main_#t~ite46_Out-2133030858|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2133030858, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133030858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2133030858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2133030858} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2133030858, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2133030858|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133030858, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2133030858, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2133030858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 14:32:53,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:32:53,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:32:53 BasicIcfg [2019-12-18 14:32:53,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:32:53,450 INFO L168 Benchmark]: Toolchain (without parser) took 64946.13 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 835.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,450 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.65 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.91 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,454 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,455 INFO L168 Benchmark]: RCFGBuilder took 836.04 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 105.8 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,461 INFO L168 Benchmark]: TraceAbstraction took 63196.61 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 781.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:32:53,464 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.52 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.65 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 157.3 MB in the end (delta: -55.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.91 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 203.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.04 ms. Allocated memory is still 203.4 MB. Free memory was 152.6 MB in the beginning and 105.8 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63196.61 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 781.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1912, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] FCALL, FORK 0 pthread_create(&t1913, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] FCALL, FORK 0 pthread_create(&t1914, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 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) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3114 SDtfs, 4177 SDslu, 8215 SDs, 0 SdLazy, 5408 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 24 SyntacticMatches, 15 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114218occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 70530 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 716 NumberOfCodeBlocks, 716 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 151488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...