/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/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:00:00,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:00:00,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:00:00,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:00:00,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:00:00,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:00:00,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:00:00,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:00:00,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:00:00,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:00:00,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:00:00,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:00:00,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:00:00,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:00:00,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:00:00,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:00:00,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:00:00,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:00:00,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:00:00,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:00:00,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:00:00,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:00:00,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:00:00,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:00:00,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:00:00,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:00:00,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:00:00,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:00:00,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:00:00,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:00:00,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:00:00,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:00:00,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:00:00,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:00:00,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:00:00,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:00:00,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:00:00,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:00:00,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:00:00,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:00:00,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:00:00,313 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:00:00,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:00:00,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:00:00,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:00:00,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:00:00,339 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:00:00,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:00:00,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:00:00,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:00:00,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:00:00,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:00:00,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:00:00,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:00:00,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:00:00,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:00:00,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:00:00,341 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:00:00,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:00:00,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:00:00,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:00:00,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:00:00,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:00:00,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:00:00,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:00:00,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:00:00,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:00:00,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:00:00,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:00:00,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:00:00,346 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:00:00,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:00:00,617 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:00:00,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:00:00,634 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:00:00,635 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:00:00,636 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:00:00,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-18 14:00:00,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67544485/e7ef986b0f614f45a57c4e0c8fd69013/FLAG8a5db5bf7 [2019-12-18 14:00:01,293 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:00:01,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2019-12-18 14:00:01,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67544485/e7ef986b0f614f45a57c4e0c8fd69013/FLAG8a5db5bf7 [2019-12-18 14:00:01,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67544485/e7ef986b0f614f45a57c4e0c8fd69013 [2019-12-18 14:00:01,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:00:01,567 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:00:01,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:00:01,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:00:01,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:00:01,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:00:01" (1/1) ... [2019-12-18 14:00:01,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ec3e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:01, skipping insertion in model container [2019-12-18 14:00:01,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:00:01" (1/1) ... [2019-12-18 14:00:01,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:00:01,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:00:02,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:00:02,212 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:00:02,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:00:02,348 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:00:02,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02 WrapperNode [2019-12-18 14:00:02,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:00:02,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:00:02,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:00:02,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:00:02,359 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:00:02" (1/1) ... [2019-12-18 14:00:02,379 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:00:02" (1/1) ... [2019-12-18 14:00:02,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:00:02,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:00:02,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:00:02,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:00:02,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (1/1) ... [2019-12-18 14:00:02,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:00:02,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:00:02,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:00:02,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:00:02,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (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:00:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:00:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:00:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:00:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:00:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:00:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:00:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:00:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:00:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:00:02,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:00:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:00:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:00:02,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:00:02,547 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:00:03,229 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:00:03,230 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:00:03,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:00:03 BoogieIcfgContainer [2019-12-18 14:00:03,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:00:03,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:00:03,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:00:03,236 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:00:03,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:00:01" (1/3) ... [2019-12-18 14:00:03,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102427c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:00:03, skipping insertion in model container [2019-12-18 14:00:03,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:02" (2/3) ... [2019-12-18 14:00:03,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102427c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:00:03, skipping insertion in model container [2019-12-18 14:00:03,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:00:03" (3/3) ... [2019-12-18 14:00:03,243 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2019-12-18 14:00:03,254 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:00:03,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:00:03,263 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:00:03,264 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:00:03,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,338 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,339 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:03,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:00:03,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:00:03,392 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:00:03,392 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:00:03,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:00:03,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:00:03,392 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:00:03,392 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:00:03,393 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:00:03,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 14:00:03,412 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 14:00:03,492 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 14:00:03,492 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:00:03,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:00:03,536 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 14:00:03,580 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 14:00:03,580 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:00:03,588 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:00:03,607 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 14:00:03,608 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:00:08,417 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:00:08,521 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:00:08,543 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-18 14:00:08,543 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 14:00:08,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:00:09,832 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-18 14:00:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-18 14:00:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 14:00:09,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:09,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:09,845 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-18 14:00:09,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:09,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545125196] [2019-12-18 14:00:09,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:10,260 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:00:10,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545125196] [2019-12-18 14:00:10,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:10,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:00:10,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100211526] [2019-12-18 14:00:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:10,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:10,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:10,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:10,285 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-18 14:00:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:10,616 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-18 14:00:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:10,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 14:00:10,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:10,787 INFO L225 Difference]: With dead ends: 16398 [2019-12-18 14:00:10,787 INFO L226 Difference]: Without dead ends: 16062 [2019-12-18 14:00:10,789 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:00:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-18 14:00:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-18 14:00:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-18 14:00:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-18 14:00:11,668 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-18 14:00:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:11,670 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-18 14:00:11,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-18 14:00:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:11,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:11,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:11,676 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-18 14:00:11,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:11,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931059216] [2019-12-18 14:00:11,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:11,785 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:00:11,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931059216] [2019-12-18 14:00:11,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:11,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:11,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589867056] [2019-12-18 14:00:11,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:11,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:11,790 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-18 14:00:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:13,236 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-18 14:00:13,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:13,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:00:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:13,335 INFO L225 Difference]: With dead ends: 24942 [2019-12-18 14:00:13,335 INFO L226 Difference]: Without dead ends: 24928 [2019-12-18 14:00:13,336 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:00:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-18 14:00:14,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-18 14:00:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-18 14:00:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-18 14:00:14,198 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-18 14:00:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:14,199 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-18 14:00:14,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-18 14:00:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:14,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:14,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:14,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-18 14:00:14,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:14,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57061280] [2019-12-18 14:00:14,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:14,250 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:00:14,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57061280] [2019-12-18 14:00:14,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:14,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:14,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845327022] [2019-12-18 14:00:14,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:14,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:14,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:14,253 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-18 14:00:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:14,329 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-18 14:00:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:14,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:00:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:14,367 INFO L225 Difference]: With dead ends: 12675 [2019-12-18 14:00:14,368 INFO L226 Difference]: Without dead ends: 12675 [2019-12-18 14:00:14,368 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:00:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-18 14:00:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-18 14:00:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-18 14:00:14,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-18 14:00:14,698 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-18 14:00:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:14,698 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-18 14:00:14,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-18 14:00:14,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:00:14,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:14,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:14,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-18 14:00:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:14,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988469366] [2019-12-18 14:00:14,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:14,752 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:00:14,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988469366] [2019-12-18 14:00:14,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:14,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:14,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469945073] [2019-12-18 14:00:14,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:14,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:14,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:14,755 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-18 14:00:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:14,863 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-18 14:00:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:00:14,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:00:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:14,868 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 14:00:14,868 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 14:00:14,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 14:00:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-18 14:00:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-18 14:00:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-18 14:00:14,901 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-18 14:00:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:14,901 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-18 14:00:14,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-18 14:00:14,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:00:14,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:14,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:14,904 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:14,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:14,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-18 14:00:14,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:14,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389423825] [2019-12-18 14:00:14,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:14,971 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:00:14,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389423825] [2019-12-18 14:00:14,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:14,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:14,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184434519] [2019-12-18 14:00:14,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:14,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:14,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:14,973 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-18 14:00:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:14,996 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 14:00:14,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:14,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:00:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:14,998 INFO L225 Difference]: With dead ends: 653 [2019-12-18 14:00:14,998 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 14:00:14,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 14:00:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 14:00:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 14:00:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 14:00:15,009 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 14:00:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 14:00:15,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 14:00:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:15,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:15,013 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] [2019-12-18 14:00:15,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:15,013 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-18 14:00:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:15,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863818137] [2019-12-18 14:00:15,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:15,125 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:00:15,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863818137] [2019-12-18 14:00:15,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:15,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:15,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818492366] [2019-12-18 14:00:15,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:15,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:15,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:15,131 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 14:00:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:15,194 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-18 14:00:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:15,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:00:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:15,196 INFO L225 Difference]: With dead ends: 607 [2019-12-18 14:00:15,196 INFO L226 Difference]: Without dead ends: 607 [2019-12-18 14:00:15,197 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:00:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-18 14:00:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-18 14:00:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-18 14:00:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-18 14:00:15,208 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-18 14:00:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:15,210 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-18 14:00:15,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-18 14:00:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:15,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:15,212 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] [2019-12-18 14:00:15,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:15,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:15,213 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-18 14:00:15,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:15,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976205402] [2019-12-18 14:00:15,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:15,347 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:00:15,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976205402] [2019-12-18 14:00:15,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:15,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:15,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142627968] [2019-12-18 14:00:15,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:15,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:15,350 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 5 states. [2019-12-18 14:00:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:15,608 INFO L93 Difference]: Finished difference Result 892 states and 2082 transitions. [2019-12-18 14:00:15,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:15,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-18 14:00:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:15,613 INFO L225 Difference]: With dead ends: 892 [2019-12-18 14:00:15,613 INFO L226 Difference]: Without dead ends: 892 [2019-12-18 14:00:15,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-18 14:00:15,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 717. [2019-12-18 14:00:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-18 14:00:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1691 transitions. [2019-12-18 14:00:15,628 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1691 transitions. Word has length 55 [2019-12-18 14:00:15,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:15,630 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1691 transitions. [2019-12-18 14:00:15,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1691 transitions. [2019-12-18 14:00:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:15,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:15,632 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] [2019-12-18 14:00:15,632 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:15,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 297273929, now seen corresponding path program 2 times [2019-12-18 14:00:15,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:15,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830746260] [2019-12-18 14:00:15,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:15,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830746260] [2019-12-18 14:00:15,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:15,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:00:15,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423023818] [2019-12-18 14:00:15,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:15,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:15,779 INFO L87 Difference]: Start difference. First operand 717 states and 1691 transitions. Second operand 6 states. [2019-12-18 14:00:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:16,096 INFO L93 Difference]: Finished difference Result 1189 states and 2773 transitions. [2019-12-18 14:00:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:00:16,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-18 14:00:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:16,099 INFO L225 Difference]: With dead ends: 1189 [2019-12-18 14:00:16,099 INFO L226 Difference]: Without dead ends: 1189 [2019-12-18 14:00:16,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:00:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-12-18 14:00:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 759. [2019-12-18 14:00:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-18 14:00:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1794 transitions. [2019-12-18 14:00:16,115 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1794 transitions. Word has length 55 [2019-12-18 14:00:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:16,116 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1794 transitions. [2019-12-18 14:00:16,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1794 transitions. [2019-12-18 14:00:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:16,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:16,119 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] [2019-12-18 14:00:16,119 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:16,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1649215159, now seen corresponding path program 3 times [2019-12-18 14:00:16,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:16,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526424775] [2019-12-18 14:00:16,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:16,210 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:00:16,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526424775] [2019-12-18 14:00:16,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:16,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:16,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871135028] [2019-12-18 14:00:16,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:16,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:16,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:16,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:16,214 INFO L87 Difference]: Start difference. First operand 759 states and 1794 transitions. Second operand 3 states. [2019-12-18 14:00:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:16,231 INFO L93 Difference]: Finished difference Result 687 states and 1586 transitions. [2019-12-18 14:00:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:16,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:00:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:16,234 INFO L225 Difference]: With dead ends: 687 [2019-12-18 14:00:16,234 INFO L226 Difference]: Without dead ends: 687 [2019-12-18 14:00:16,234 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:00:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-18 14:00:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2019-12-18 14:00:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-18 14:00:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-18 14:00:16,248 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 55 [2019-12-18 14:00:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:16,248 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-18 14:00:16,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-18 14:00:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:00:16,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:16,252 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:00:16,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 1 times [2019-12-18 14:00:16,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:16,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972806085] [2019-12-18 14:00:16,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:16,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:00:16,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972806085] [2019-12-18 14:00:16,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:16,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:00:16,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586508355] [2019-12-18 14:00:16,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:00:16,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:00:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:16,505 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 12 states. [2019-12-18 14:00:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:17,217 INFO L93 Difference]: Finished difference Result 1518 states and 3177 transitions. [2019-12-18 14:00:17,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:00:17,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 14:00:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,219 INFO L225 Difference]: With dead ends: 1518 [2019-12-18 14:00:17,219 INFO L226 Difference]: Without dead ends: 866 [2019-12-18 14:00:17,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:00:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-12-18 14:00:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 601. [2019-12-18 14:00:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-18 14:00:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1351 transitions. [2019-12-18 14:00:17,231 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1351 transitions. Word has length 56 [2019-12-18 14:00:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:17,231 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1351 transitions. [2019-12-18 14:00:17,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:00:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1351 transitions. [2019-12-18 14:00:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:00:17,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:17,234 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:00:17,234 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1651570348, now seen corresponding path program 2 times [2019-12-18 14:00:17,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:17,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133353129] [2019-12-18 14:00:17,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:17,356 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:00:17,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133353129] [2019-12-18 14:00:17,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:17,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:17,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347121389] [2019-12-18 14:00:17,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:17,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:17,360 INFO L87 Difference]: Start difference. First operand 601 states and 1351 transitions. Second operand 6 states. [2019-12-18 14:00:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:17,439 INFO L93 Difference]: Finished difference Result 929 states and 1989 transitions. [2019-12-18 14:00:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:17,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 14:00:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,441 INFO L225 Difference]: With dead ends: 929 [2019-12-18 14:00:17,442 INFO L226 Difference]: Without dead ends: 323 [2019-12-18 14:00:17,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:00:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-18 14:00:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 293. [2019-12-18 14:00:17,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-12-18 14:00:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 520 transitions. [2019-12-18 14:00:17,450 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 520 transitions. Word has length 56 [2019-12-18 14:00:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:17,450 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 520 transitions. [2019-12-18 14:00:17,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 520 transitions. [2019-12-18 14:00:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:00:17,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:17,452 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:00:17,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1330379112, now seen corresponding path program 3 times [2019-12-18 14:00:17,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:17,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038128597] [2019-12-18 14:00:17,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:17,541 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:00:17,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038128597] [2019-12-18 14:00:17,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:17,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:17,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896374799] [2019-12-18 14:00:17,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:17,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:17,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:17,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:17,544 INFO L87 Difference]: Start difference. First operand 293 states and 520 transitions. Second operand 3 states. [2019-12-18 14:00:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:17,585 INFO L93 Difference]: Finished difference Result 292 states and 518 transitions. [2019-12-18 14:00:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:17,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 14:00:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:17,586 INFO L225 Difference]: With dead ends: 292 [2019-12-18 14:00:17,586 INFO L226 Difference]: Without dead ends: 292 [2019-12-18 14:00:17,587 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:00:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-12-18 14:00:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2019-12-18 14:00:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-18 14:00:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-18 14:00:17,591 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 56 [2019-12-18 14:00:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:17,591 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-18 14:00:17,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-18 14:00:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:17,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:17,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:17,593 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:17,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 1 times [2019-12-18 14:00:17,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:17,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100572844] [2019-12-18 14:00:17,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:17,811 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:00:17,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100572844] [2019-12-18 14:00:17,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:17,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:00:17,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837053051] [2019-12-18 14:00:17,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:00:17,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:17,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:00:17,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:17,814 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 13 states. [2019-12-18 14:00:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:18,253 INFO L93 Difference]: Finished difference Result 379 states and 652 transitions. [2019-12-18 14:00:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:00:18,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 14:00:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:18,254 INFO L225 Difference]: With dead ends: 379 [2019-12-18 14:00:18,254 INFO L226 Difference]: Without dead ends: 349 [2019-12-18 14:00:18,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:00:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-18 14:00:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 307. [2019-12-18 14:00:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 14:00:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 14:00:18,259 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-18 14:00:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:18,260 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 14:00:18,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:00:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 14:00:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:18,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:18,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:18,262 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 2 times [2019-12-18 14:00:18,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:18,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395656416] [2019-12-18 14:00:18,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:18,496 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:00:18,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395656416] [2019-12-18 14:00:18,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:18,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:00:18,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392636526] [2019-12-18 14:00:18,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:00:18,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:18,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:00:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:18,499 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 12 states. [2019-12-18 14:00:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:18,880 INFO L93 Difference]: Finished difference Result 407 states and 688 transitions. [2019-12-18 14:00:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:00:18,881 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 14:00:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:18,882 INFO L225 Difference]: With dead ends: 407 [2019-12-18 14:00:18,882 INFO L226 Difference]: Without dead ends: 377 [2019-12-18 14:00:18,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:00:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-12-18 14:00:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 315. [2019-12-18 14:00:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-18 14:00:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-18 14:00:18,889 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-18 14:00:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-18 14:00:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:00:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-18 14:00:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:18,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:18,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:18,891 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 3 times [2019-12-18 14:00:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469081431] [2019-12-18 14:00:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:00:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:00:18,988 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:00:18,988 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:00:18,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= |v_ULTIMATE.start_main_~#t1504~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.base_6) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1504~0.base_26| 4) |v_#length_23|) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1504~0.base_26|) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_26|)) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1504~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1504~0.base_26|) |v_ULTIMATE.start_main_~#t1504~0.offset_19| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1504~0.base_26| 1) |v_#valid_60|) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1504~0.base=|v_ULTIMATE.start_main_~#t1504~0.base_26|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1504~0.offset=|v_ULTIMATE.start_main_~#t1504~0.offset_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_19|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_21|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_26|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1504~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1504~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1506~0.offset, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1505~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1506~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1505~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:00:18,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1505~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| 4) |v_#length_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1505~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1505~0.base_13|) |v_ULTIMATE.start_main_~#t1505~0.offset_11| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1505~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1505~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1505~0.offset=|v_ULTIMATE.start_main_~#t1505~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1505~0.base=|v_ULTIMATE.start_main_~#t1505~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1505~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1505~0.base, #length] because there is no mapped edge [2019-12-18 14:00:18,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1506~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1506~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12|) 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1506~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1506~0.base_12|) |v_ULTIMATE.start_main_~#t1506~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1506~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1506~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1506~0.base=|v_ULTIMATE.start_main_~#t1506~0.base_12|, ULTIMATE.start_main_~#t1506~0.offset=|v_ULTIMATE.start_main_~#t1506~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1506~0.base, ULTIMATE.start_main_~#t1506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 14:00:18,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:00:18,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 14:00:18,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2087917159 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In2087917159 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out2087917159| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In2087917159 |P2Thread1of1ForFork0_#t~ite11_Out2087917159|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2087917159, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2087917159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2087917159, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out2087917159|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2087917159} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 14:00:18,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-918055341 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-918055341 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-918055341| ~y$w_buff1~0_In-918055341) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-918055341| ~y~0_In-918055341)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-918055341, ~y$w_buff1~0=~y$w_buff1~0_In-918055341, ~y~0=~y~0_In-918055341, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-918055341} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-918055341, ~y$w_buff1~0=~y$w_buff1~0_In-918055341, ~y~0=~y~0_In-918055341, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-918055341|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-918055341} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 14:00:18,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 14:00:18,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1120557504 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1120557504 256) 0))) (or (and (= ~y$w_buff0_used~0_In1120557504 |P1Thread1of1ForFork2_#t~ite5_Out1120557504|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out1120557504| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1120557504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1120557504} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1120557504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1120557504, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1120557504|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 14:00:19,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In957396549 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In957396549 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In957396549 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In957396549 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out957396549| ~y$w_buff1_used~0_In957396549) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite6_Out957396549|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In957396549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957396549, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In957396549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957396549} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In957396549, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957396549, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In957396549, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out957396549|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957396549} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 14:00:19,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1674755693 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1674755693 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1674755693| 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1674755693 |P1Thread1of1ForFork2_#t~ite7_Out1674755693|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1674755693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1674755693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1674755693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1674755693, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1674755693|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 14:00:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In122313708 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In122313708 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In122313708 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In122313708 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out122313708|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out122313708| ~y$w_buff1_used~0_In122313708) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In122313708, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122313708, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In122313708, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122313708} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In122313708, ~y$w_buff0_used~0=~y$w_buff0_used~0_In122313708, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out122313708|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In122313708, ~y$w_buff1_used~0=~y$w_buff1_used~0_In122313708} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 14:00:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-631341393 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-631341393 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-631341393 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-631341393 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-631341393 |P1Thread1of1ForFork2_#t~ite8_Out-631341393|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-631341393|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-631341393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-631341393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-631341393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-631341393} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-631341393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-631341393, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-631341393|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-631341393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-631341393} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 14:00:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 14:00:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In840085592 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In840085592 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In840085592 ~y$r_buff0_thd3~0_Out840085592) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out840085592 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In840085592, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In840085592} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In840085592, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out840085592, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out840085592|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 14:00:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1725334859 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1725334859 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1725334859 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1725334859 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1725334859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1725334859| ~y$r_buff1_thd3~0_In1725334859)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1725334859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725334859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1725334859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725334859} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1725334859|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1725334859, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1725334859, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1725334859, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1725334859} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 14:00:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 14:00:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:00:19,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In113496050 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In113496050 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite18_Out113496050| ~y~0_In113496050)) (and (= |ULTIMATE.start_main_#t~ite18_Out113496050| ~y$w_buff1~0_In113496050) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In113496050, ~y~0=~y~0_In113496050, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In113496050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113496050} OutVars{~y$w_buff1~0=~y$w_buff1~0_In113496050, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out113496050|, ~y~0=~y~0_In113496050, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In113496050, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113496050} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 14:00:19,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 14:00:19,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1758379365 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1758379365 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-1758379365| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-1758379365| ~y$w_buff0_used~0_In-1758379365) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758379365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758379365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758379365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758379365, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1758379365|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:00:19,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1062851818 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1062851818 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1062851818 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1062851818 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite21_Out-1062851818| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1062851818 |ULTIMATE.start_main_#t~ite21_Out-1062851818|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062851818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1062851818, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1062851818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062851818} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062851818, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1062851818, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1062851818|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1062851818, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062851818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:00:19,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1744462539 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1744462539 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-1744462539 |ULTIMATE.start_main_#t~ite22_Out-1744462539|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-1744462539|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1744462539, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1744462539} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1744462539, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1744462539, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1744462539|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:00:19,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2096777476 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2096777476 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2096777476 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2096777476 256)))) (or (and (= ~y$r_buff1_thd0~0_In2096777476 |ULTIMATE.start_main_#t~ite23_Out2096777476|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out2096777476| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2096777476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2096777476, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096777476, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096777476} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2096777476, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2096777476, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096777476, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out2096777476|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096777476} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 14:00:19,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-141835409 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out-141835409| ~y$w_buff0~0_In-141835409) (= |ULTIMATE.start_main_#t~ite29_In-141835409| |ULTIMATE.start_main_#t~ite29_Out-141835409|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite29_Out-141835409| ~y$w_buff0~0_In-141835409) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-141835409 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-141835409 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-141835409 256)) (and (= (mod ~y$w_buff1_used~0_In-141835409 256) 0) .cse1))) .cse0 (= |ULTIMATE.start_main_#t~ite29_Out-141835409| |ULTIMATE.start_main_#t~ite30_Out-141835409|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-141835409, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-141835409|, ~y$w_buff0~0=~y$w_buff0~0_In-141835409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-141835409, ~weak$$choice2~0=~weak$$choice2~0_In-141835409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-141835409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-141835409} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-141835409|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-141835409, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-141835409|, ~y$w_buff0~0=~y$w_buff0~0_In-141835409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-141835409, ~weak$$choice2~0=~weak$$choice2~0_In-141835409, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-141835409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-141835409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:00:19,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:00:19,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:00:19,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:00:19,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:00:19 BasicIcfg [2019-12-18 14:00:19,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:00:19,118 INFO L168 Benchmark]: Toolchain (without parser) took 17551.72 ms. Allocated memory was 145.8 MB in the beginning and 771.2 MB in the end (delta: 625.5 MB). Free memory was 101.1 MB in the beginning and 263.7 MB in the end (delta: -162.6 MB). Peak memory consumption was 462.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:19,121 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:00:19,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.21 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 157.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:19,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 153.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:19,123 INFO L168 Benchmark]: Boogie Preprocessor took 39.95 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:19,124 INFO L168 Benchmark]: RCFGBuilder took 772.00 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 104.5 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:00:19,124 INFO L168 Benchmark]: TraceAbstraction took 15881.20 ms. Allocated memory was 202.9 MB in the beginning and 771.2 MB in the end (delta: 568.3 MB). Free memory was 104.5 MB in the beginning and 263.7 MB in the end (delta: -159.2 MB). Peak memory consumption was 409.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:19,128 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.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.21 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 157.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.81 ms. Allocated memory is still 202.9 MB. Free memory was 157.1 MB in the beginning and 153.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.95 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 772.00 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 104.5 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15881.20 ms. Allocated memory was 202.9 MB in the beginning and 771.2 MB in the end (delta: 568.3 MB). Free memory was 104.5 MB in the beginning and 263.7 MB in the end (delta: -159.2 MB). Peak memory consumption was 409.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1401 SDtfs, 1430 SDslu, 3483 SDs, 0 SdLazy, 1716 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred 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: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 3935 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 116723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...