/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:53:51,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:53:51,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:53:51,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:53:51,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:53:51,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:53:51,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:53:51,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:53:51,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:53:51,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:53:51,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:53:51,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:53:51,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:53:51,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:53:51,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:53:51,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:53:51,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:53:51,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:53:51,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:53:51,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:53:51,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:53:51,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:53:51,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:53:51,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:53:51,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:53:51,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:53:51,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:53:51,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:53:51,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:53:51,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:53:51,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:53:51,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:53:51,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:53:51,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:53:51,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:53:51,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:53:51,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:53:51,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:53:51,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:53:51,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:53:51,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:53:51,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:53:51,481 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:53:51,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:53:51,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:53:51,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:53:51,484 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:53:51,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:53:51,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:53:51,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:53:51,485 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:53:51,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:53:51,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:53:51,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:53:51,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:53:51,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:53:51,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:53:51,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:53:51,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:53:51,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:53:51,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:53:51,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:53:51,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:53:51,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:53:51,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:53:51,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:53:51,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:53:51,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:53:51,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:53:51,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:53:51,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:53:51,775 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:53:51,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 06:53:51,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d24c21/60e3e00d82e1434289c2b27a6c40a2e0/FLAG1e3e5f515 [2019-12-27 06:53:52,393 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:53:52,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 06:53:52,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d24c21/60e3e00d82e1434289c2b27a6c40a2e0/FLAG1e3e5f515 [2019-12-27 06:53:52,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a9d24c21/60e3e00d82e1434289c2b27a6c40a2e0 [2019-12-27 06:53:52,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:53:52,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:53:52,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:53:52,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:53:52,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:53:52,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:53:52" (1/1) ... [2019-12-27 06:53:52,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fa9228c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:52, skipping insertion in model container [2019-12-27 06:53:52,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:53:52" (1/1) ... [2019-12-27 06:53:52,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:53:52,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:53:53,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:53:53,291 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:53:53,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:53:53,441 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:53:53,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53 WrapperNode [2019-12-27 06:53:53,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:53:53,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:53:53,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:53:53,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:53:53,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:53:53,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:53:53,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:53:53,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:53:53,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... [2019-12-27 06:53:53,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:53:53,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:53:53,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:53:53,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:53:53,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:53:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:53:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:53:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:53:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:53:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:53:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:53:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:53:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:53:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:53:53,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:53:53,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:53:53,631 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:53:54,352 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:53:54,352 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:53:54,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:53:54 BoogieIcfgContainer [2019-12-27 06:53:54,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:53:54,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:53:54,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:53:54,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:53:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:53:52" (1/3) ... [2019-12-27 06:53:54,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f09ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:53:54, skipping insertion in model container [2019-12-27 06:53:54,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:53:53" (2/3) ... [2019-12-27 06:53:54,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f09ce39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:53:54, skipping insertion in model container [2019-12-27 06:53:54,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:53:54" (3/3) ... [2019-12-27 06:53:54,363 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-12-27 06:53:54,373 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:53:54,374 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:53:54,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:53:54,384 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:53:54,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,420 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,429 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,430 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,443 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,444 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,446 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,447 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:53:54,467 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:53:54,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:53:54,489 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:53:54,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:53:54,489 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:53:54,489 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:53:54,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:53:54,490 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:53:54,490 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:53:54,506 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 06:53:54,508 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:53:54,626 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:53:54,627 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:53:54,645 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:53:54,663 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:53:54,737 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:53:54,737 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:53:54,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:53:54,756 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 06:53:54,757 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:53:57,733 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 06:53:57,839 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 06:53:57,861 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48801 [2019-12-27 06:53:57,861 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 06:53:57,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-27 06:53:58,327 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9180 states. [2019-12-27 06:53:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states. [2019-12-27 06:53:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:53:58,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:58,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:53:58,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:58,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash 690083796, now seen corresponding path program 1 times [2019-12-27 06:53:58,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:58,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066002082] [2019-12-27 06:53:58,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:58,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:58,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066002082] [2019-12-27 06:53:58,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:58,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:53:58,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716996562] [2019-12-27 06:53:58,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:58,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:58,650 INFO L87 Difference]: Start difference. First operand 9180 states. Second operand 3 states. [2019-12-27 06:53:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:58,920 INFO L93 Difference]: Finished difference Result 9108 states and 29960 transitions. [2019-12-27 06:53:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:58,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:53:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:59,017 INFO L225 Difference]: With dead ends: 9108 [2019-12-27 06:53:59,018 INFO L226 Difference]: Without dead ends: 8926 [2019-12-27 06:53:59,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-12-27 06:53:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8926. [2019-12-27 06:53:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2019-12-27 06:53:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 29401 transitions. [2019-12-27 06:53:59,539 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 29401 transitions. Word has length 5 [2019-12-27 06:53:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:59,540 INFO L462 AbstractCegarLoop]: Abstraction has 8926 states and 29401 transitions. [2019-12-27 06:53:59,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 29401 transitions. [2019-12-27 06:53:59,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:53:59,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:59,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:59,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:59,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash 741678959, now seen corresponding path program 1 times [2019-12-27 06:53:59,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:59,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032838352] [2019-12-27 06:53:59,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:59,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032838352] [2019-12-27 06:53:59,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:59,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:59,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236166952] [2019-12-27 06:53:59,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:53:59,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:53:59,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:59,645 INFO L87 Difference]: Start difference. First operand 8926 states and 29401 transitions. Second operand 3 states. [2019-12-27 06:53:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:53:59,671 INFO L93 Difference]: Finished difference Result 1402 states and 3230 transitions. [2019-12-27 06:53:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:53:59,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 06:53:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:53:59,680 INFO L225 Difference]: With dead ends: 1402 [2019-12-27 06:53:59,680 INFO L226 Difference]: Without dead ends: 1402 [2019-12-27 06:53:59,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:53:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-12-27 06:53:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-12-27 06:53:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-12-27 06:53:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 3230 transitions. [2019-12-27 06:53:59,717 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 3230 transitions. Word has length 11 [2019-12-27 06:53:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:53:59,717 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 3230 transitions. [2019-12-27 06:53:59,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:53:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 3230 transitions. [2019-12-27 06:53:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:53:59,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:53:59,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:53:59,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:53:59,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:53:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash 520956806, now seen corresponding path program 1 times [2019-12-27 06:53:59,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:53:59,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826965960] [2019-12-27 06:53:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:53:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:53:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:53:59,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826965960] [2019-12-27 06:53:59,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:53:59,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:53:59,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142165217] [2019-12-27 06:53:59,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:53:59,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:53:59,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:53:59,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:53:59,847 INFO L87 Difference]: Start difference. First operand 1402 states and 3230 transitions. Second operand 4 states. [2019-12-27 06:54:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,129 INFO L93 Difference]: Finished difference Result 1878 states and 4185 transitions. [2019-12-27 06:54:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:00,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:54:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,140 INFO L225 Difference]: With dead ends: 1878 [2019-12-27 06:54:00,140 INFO L226 Difference]: Without dead ends: 1878 [2019-12-27 06:54:00,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2019-12-27 06:54:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2019-12-27 06:54:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-27 06:54:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 3896 transitions. [2019-12-27 06:54:00,187 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 3896 transitions. Word has length 11 [2019-12-27 06:54:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:00,187 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 3896 transitions. [2019-12-27 06:54:00,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 3896 transitions. [2019-12-27 06:54:00,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:54:00,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:00,191 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] [2019-12-27 06:54:00,191 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:00,191 INFO L82 PathProgramCache]: Analyzing trace with hash -707662606, now seen corresponding path program 1 times [2019-12-27 06:54:00,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:00,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638381820] [2019-12-27 06:54:00,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:00,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638381820] [2019-12-27 06:54:00,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:00,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:00,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665853467] [2019-12-27 06:54:00,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:00,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:00,269 INFO L87 Difference]: Start difference. First operand 1726 states and 3896 transitions. Second operand 4 states. [2019-12-27 06:54:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,284 INFO L93 Difference]: Finished difference Result 357 states and 661 transitions. [2019-12-27 06:54:00,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:00,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 06:54:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,286 INFO L225 Difference]: With dead ends: 357 [2019-12-27 06:54:00,286 INFO L226 Difference]: Without dead ends: 357 [2019-12-27 06:54:00,287 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-27 06:54:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-27 06:54:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 322. [2019-12-27 06:54:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 06:54:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 596 transitions. [2019-12-27 06:54:00,295 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 596 transitions. Word has length 23 [2019-12-27 06:54:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:00,295 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 596 transitions. [2019-12-27 06:54:00,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 596 transitions. [2019-12-27 06:54:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:00,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:00,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:00,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:00,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1936914374, now seen corresponding path program 1 times [2019-12-27 06:54:00,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:00,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129048007] [2019-12-27 06:54:00,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:00,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129048007] [2019-12-27 06:54:00,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:00,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:00,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672493134] [2019-12-27 06:54:00,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:00,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:00,433 INFO L87 Difference]: Start difference. First operand 322 states and 596 transitions. Second operand 3 states. [2019-12-27 06:54:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,489 INFO L93 Difference]: Finished difference Result 332 states and 611 transitions. [2019-12-27 06:54:00,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:00,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,492 INFO L225 Difference]: With dead ends: 332 [2019-12-27 06:54:00,492 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 06:54:00,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 06:54:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 328. [2019-12-27 06:54:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 06:54:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 607 transitions. [2019-12-27 06:54:00,500 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 607 transitions. Word has length 52 [2019-12-27 06:54:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:00,501 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 607 transitions. [2019-12-27 06:54:00,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 607 transitions. [2019-12-27 06:54:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:00,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:00,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:00,504 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:00,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1506335965, now seen corresponding path program 1 times [2019-12-27 06:54:00,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:00,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832268837] [2019-12-27 06:54:00,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:00,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832268837] [2019-12-27 06:54:00,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:00,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:54:00,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648576015] [2019-12-27 06:54:00,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:00,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:00,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:00,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:00,627 INFO L87 Difference]: Start difference. First operand 328 states and 607 transitions. Second operand 5 states. [2019-12-27 06:54:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:00,856 INFO L93 Difference]: Finished difference Result 459 states and 843 transitions. [2019-12-27 06:54:00,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:54:00,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 06:54:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:00,861 INFO L225 Difference]: With dead ends: 459 [2019-12-27 06:54:00,861 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 06:54:00,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 06:54:00,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 375. [2019-12-27 06:54:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-12-27 06:54:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 698 transitions. [2019-12-27 06:54:00,871 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 698 transitions. Word has length 52 [2019-12-27 06:54:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:00,871 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 698 transitions. [2019-12-27 06:54:00,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 698 transitions. [2019-12-27 06:54:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:00,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:00,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:00,873 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash -788706827, now seen corresponding path program 2 times [2019-12-27 06:54:00,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:00,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032955878] [2019-12-27 06:54:00,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:01,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032955878] [2019-12-27 06:54:01,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:01,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:01,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958275953] [2019-12-27 06:54:01,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:01,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:01,040 INFO L87 Difference]: Start difference. First operand 375 states and 698 transitions. Second operand 3 states. [2019-12-27 06:54:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:01,053 INFO L93 Difference]: Finished difference Result 375 states and 683 transitions. [2019-12-27 06:54:01,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:01,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:01,056 INFO L225 Difference]: With dead ends: 375 [2019-12-27 06:54:01,056 INFO L226 Difference]: Without dead ends: 375 [2019-12-27 06:54:01,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-27 06:54:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2019-12-27 06:54:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 06:54:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 661 transitions. [2019-12-27 06:54:01,065 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 661 transitions. Word has length 52 [2019-12-27 06:54:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:01,065 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 661 transitions. [2019-12-27 06:54:01,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 661 transitions. [2019-12-27 06:54:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:01,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:01,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:01,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash -817414714, now seen corresponding path program 1 times [2019-12-27 06:54:01,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:01,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579433734] [2019-12-27 06:54:01,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:01,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579433734] [2019-12-27 06:54:01,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:01,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:01,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568610321] [2019-12-27 06:54:01,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:01,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:01,140 INFO L87 Difference]: Start difference. First operand 363 states and 661 transitions. Second operand 3 states. [2019-12-27 06:54:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:01,188 INFO L93 Difference]: Finished difference Result 363 states and 660 transitions. [2019-12-27 06:54:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:01,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 06:54:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:01,191 INFO L225 Difference]: With dead ends: 363 [2019-12-27 06:54:01,191 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 06:54:01,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 06:54:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 274. [2019-12-27 06:54:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-12-27 06:54:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 499 transitions. [2019-12-27 06:54:01,198 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 499 transitions. Word has length 53 [2019-12-27 06:54:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:01,199 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 499 transitions. [2019-12-27 06:54:01,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 499 transitions. [2019-12-27 06:54:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:01,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:01,200 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] [2019-12-27 06:54:01,200 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:01,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1599315070, now seen corresponding path program 1 times [2019-12-27 06:54:01,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:01,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089371139] [2019-12-27 06:54:01,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:01,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089371139] [2019-12-27 06:54:01,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:01,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:54:01,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120724991] [2019-12-27 06:54:01,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:54:01,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:54:01,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:54:01,504 INFO L87 Difference]: Start difference. First operand 274 states and 499 transitions. Second operand 12 states. [2019-12-27 06:54:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:02,211 INFO L93 Difference]: Finished difference Result 692 states and 1215 transitions. [2019-12-27 06:54:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:54:02,212 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-27 06:54:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:02,215 INFO L225 Difference]: With dead ends: 692 [2019-12-27 06:54:02,215 INFO L226 Difference]: Without dead ends: 234 [2019-12-27 06:54:02,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:54:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-12-27 06:54:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 210. [2019-12-27 06:54:02,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-12-27 06:54:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 372 transitions. [2019-12-27 06:54:02,221 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 372 transitions. Word has length 54 [2019-12-27 06:54:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:02,276 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 372 transitions. [2019-12-27 06:54:02,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:54:02,276 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 372 transitions. [2019-12-27 06:54:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:02,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:02,277 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] [2019-12-27 06:54:02,277 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:02,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1986508478, now seen corresponding path program 2 times [2019-12-27 06:54:02,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:02,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989134373] [2019-12-27 06:54:02,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:02,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989134373] [2019-12-27 06:54:02,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:02,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:54:02,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187780032] [2019-12-27 06:54:02,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:54:02,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:54:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:54:02,586 INFO L87 Difference]: Start difference. First operand 210 states and 372 transitions. Second operand 14 states. [2019-12-27 06:54:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:03,162 INFO L93 Difference]: Finished difference Result 378 states and 653 transitions. [2019-12-27 06:54:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:54:03,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 06:54:03,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:03,166 INFO L225 Difference]: With dead ends: 378 [2019-12-27 06:54:03,166 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 06:54:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:54:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 06:54:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 310. [2019-12-27 06:54:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-12-27 06:54:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 543 transitions. [2019-12-27 06:54:03,174 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 543 transitions. Word has length 54 [2019-12-27 06:54:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:03,174 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 543 transitions. [2019-12-27 06:54:03,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:54:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 543 transitions. [2019-12-27 06:54:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:03,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:03,176 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] [2019-12-27 06:54:03,176 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:03,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1943073384, now seen corresponding path program 3 times [2019-12-27 06:54:03,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:03,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221887943] [2019-12-27 06:54:03,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:03,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221887943] [2019-12-27 06:54:03,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:03,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 06:54:03,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246146879] [2019-12-27 06:54:03,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 06:54:03,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 06:54:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:54:03,836 INFO L87 Difference]: Start difference. First operand 310 states and 543 transitions. Second operand 19 states. [2019-12-27 06:54:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:05,020 INFO L93 Difference]: Finished difference Result 808 states and 1380 transitions. [2019-12-27 06:54:05,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:54:05,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2019-12-27 06:54:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:05,026 INFO L225 Difference]: With dead ends: 808 [2019-12-27 06:54:05,026 INFO L226 Difference]: Without dead ends: 774 [2019-12-27 06:54:05,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 06:54:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-12-27 06:54:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 329. [2019-12-27 06:54:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:54:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 579 transitions. [2019-12-27 06:54:05,037 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 579 transitions. Word has length 54 [2019-12-27 06:54:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:05,037 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 579 transitions. [2019-12-27 06:54:05,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 06:54:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 579 transitions. [2019-12-27 06:54:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:05,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:05,039 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] [2019-12-27 06:54:05,039 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2083989660, now seen corresponding path program 4 times [2019-12-27 06:54:05,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:05,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167461752] [2019-12-27 06:54:05,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:54:05,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167461752] [2019-12-27 06:54:05,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:05,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:54:05,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101877403] [2019-12-27 06:54:05,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:54:05,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:54:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:54:05,320 INFO L87 Difference]: Start difference. First operand 329 states and 579 transitions. Second operand 14 states. [2019-12-27 06:54:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:06,141 INFO L93 Difference]: Finished difference Result 497 states and 836 transitions. [2019-12-27 06:54:06,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:54:06,142 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-27 06:54:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:06,146 INFO L225 Difference]: With dead ends: 497 [2019-12-27 06:54:06,146 INFO L226 Difference]: Without dead ends: 463 [2019-12-27 06:54:06,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2019-12-27 06:54:06,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-12-27 06:54:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 318. [2019-12-27 06:54:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-12-27 06:54:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 557 transitions. [2019-12-27 06:54:06,154 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 557 transitions. Word has length 54 [2019-12-27 06:54:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:06,154 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 557 transitions. [2019-12-27 06:54:06,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:54:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 557 transitions. [2019-12-27 06:54:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 06:54:06,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:06,156 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] [2019-12-27 06:54:06,156 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1497243502, now seen corresponding path program 5 times [2019-12-27 06:54:06,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:06,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462604623] [2019-12-27 06:54:06,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:06,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:06,272 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:06,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= v_~x$r_buff1_thd1~0_19 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~x$w_buff1~0_25) (= v_~main$tmp_guard1~0_11 0) (= v_~x~0_27 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1447~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_16 0) (= |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0) (= 0 v_~x$w_buff0_used~0_104) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~x$w_buff1_used~0_65 0) (= v_~x$r_buff1_thd0~0_48 0) (= 0 v_~x$r_buff0_thd0~0_76) (= v_~x$r_buff1_thd2~0_16 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) (= 0 v_~y~0_8) (= |v_#NULL.offset_4| 0) (= 0 v_~x$r_buff0_thd2~0_25) (= v_~x$mem_tmp~0_11 0) (= 0 v_~weak$$choice0~0_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22| 1) |v_#valid_47|) (= 0 v_~x$w_buff0~0_28) (= 0 v_~__unbuffered_cnt~0_16) (= 0 v_~x$r_buff0_thd1~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_28, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_9|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_9|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|, ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_7|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_65, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_17|, ~x~0=v_~x~0_27, ULTIMATE.start_main_~#t1447~0.offset=|v_ULTIMATE.start_main_~#t1447~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_~#t1447~0.base=|v_ULTIMATE.start_main_~#t1447~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y~0=v_~y~0_8, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_48, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1448~0.offset, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1448~0.base, ~x~0, ULTIMATE.start_main_~#t1447~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_~#t1447~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:54:06,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1448~0.base_10| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1448~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1448~0.offset_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10|) |v_ULTIMATE.start_main_~#t1448~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1448~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1448~0.base] because there is no mapped edge [2019-12-27 06:54:06,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_18) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= 0 (mod v_~x$w_buff1_used~0_57 256)) (= 1 v_~x$w_buff0_used~0_88) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff1_used~0_57 v_~x$w_buff0_used~0_89) (= 2 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_18, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 06:54:06,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-1732799281| |P0Thread1of1ForFork0_#t~ite3_Out-1732799281|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1732799281 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1732799281 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out-1732799281| ~x~0_In-1732799281) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out-1732799281| ~x$w_buff1~0_In-1732799281)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1732799281, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1732799281, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1732799281, ~x~0=~x~0_In-1732799281} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1732799281|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1732799281|, ~x$w_buff1~0=~x$w_buff1~0_In-1732799281, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1732799281, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1732799281, ~x~0=~x~0_In-1732799281} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 06:54:06,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1766853824 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1766853824 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1766853824| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1766853824 |P0Thread1of1ForFork0_#t~ite5_Out1766853824|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1766853824, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766853824} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1766853824|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1766853824, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766853824} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:54:06,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In360734259 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In360734259 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In360734259 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In360734259 256)))) (or (and (= ~x$w_buff1_used~0_In360734259 |P0Thread1of1ForFork0_#t~ite6_Out360734259|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out360734259|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In360734259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360734259, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In360734259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360734259} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out360734259|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In360734259, ~x$w_buff1_used~0=~x$w_buff1_used~0_In360734259, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In360734259, ~x$w_buff0_used~0=~x$w_buff0_used~0_In360734259} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:54:06,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-371197713 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-371197713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-371197713|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-371197713 |P1Thread1of1ForFork1_#t~ite11_Out-371197713|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-371197713, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371197713} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-371197713|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-371197713, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-371197713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 06:54:06,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In12062758 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In12062758 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out12062758| ~x$r_buff0_thd1~0_In12062758) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out12062758| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In12062758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In12062758} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In12062758, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out12062758|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In12062758} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 06:54:06,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1220578786 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1220578786 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1220578786 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1220578786 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1220578786|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1220578786| ~x$r_buff1_thd1~0_In1220578786) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1220578786, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1220578786, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1220578786, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1220578786} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1220578786, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1220578786|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1220578786, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1220578786, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1220578786} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:54:06,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:54:06,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1402817344 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1402817344 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1402817344 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1402817344 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1402817344 |P1Thread1of1ForFork1_#t~ite12_Out1402817344|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1402817344|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1402817344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1402817344, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1402817344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402817344} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1402817344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1402817344, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1402817344|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1402817344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1402817344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:54:06,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1993036249 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1993036249 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-1993036249)) (and (= ~x$r_buff0_thd2~0_In-1993036249 ~x$r_buff0_thd2~0_Out-1993036249) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1993036249, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1993036249} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1993036249|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1993036249, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1993036249} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 06:54:06,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In535838732 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In535838732 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In535838732 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In535838732 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out535838732| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out535838732| ~x$r_buff1_thd2~0_In535838732)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In535838732, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In535838732, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In535838732, ~x$w_buff0_used~0=~x$w_buff0_used~0_In535838732} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In535838732, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In535838732, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In535838732, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out535838732|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In535838732} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:54:06,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:54:06,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:54:06,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-2103931890| |ULTIMATE.start_main_#t~ite17_Out-2103931890|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2103931890 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-2103931890 256)))) (or (and .cse0 (= ~x$w_buff1~0_In-2103931890 |ULTIMATE.start_main_#t~ite17_Out-2103931890|) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~x~0_In-2103931890 |ULTIMATE.start_main_#t~ite17_Out-2103931890|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2103931890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2103931890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2103931890, ~x~0=~x~0_In-2103931890} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2103931890|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2103931890|, ~x$w_buff1~0=~x$w_buff1~0_In-2103931890, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2103931890, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2103931890, ~x~0=~x~0_In-2103931890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 06:54:06,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In772843418 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In772843418 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out772843418|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In772843418 |ULTIMATE.start_main_#t~ite19_Out772843418|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In772843418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772843418} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In772843418, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out772843418|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In772843418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:54:06,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In173289843 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In173289843 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In173289843 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In173289843 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In173289843 |ULTIMATE.start_main_#t~ite20_Out173289843|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite20_Out173289843|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In173289843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In173289843, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In173289843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In173289843} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In173289843, ~x$w_buff1_used~0=~x$w_buff1_used~0_In173289843, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out173289843|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In173289843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In173289843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:54:06,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In914535290 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In914535290 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out914535290| ~x$r_buff0_thd0~0_In914535290) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out914535290| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In914535290, ~x$w_buff0_used~0=~x$w_buff0_used~0_In914535290} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In914535290, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out914535290|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In914535290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:54:06,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1114409675 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1114409675 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1114409675 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1114409675 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1114409675| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-1114409675| ~x$r_buff1_thd0~0_In-1114409675)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1114409675, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114409675, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1114409675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114409675} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1114409675, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114409675, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1114409675, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1114409675|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114409675} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:54:06,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L800-->L800-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-462944246 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-462944246 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-462944246 256))) (= (mod ~x$w_buff0_used~0_In-462944246 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-462944246 256))))) .cse1 (= ~x$w_buff1~0_In-462944246 |ULTIMATE.start_main_#t~ite31_Out-462944246|) (= |ULTIMATE.start_main_#t~ite32_Out-462944246| |ULTIMATE.start_main_#t~ite31_Out-462944246|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite31_In-462944246| |ULTIMATE.start_main_#t~ite31_Out-462944246|) (= |ULTIMATE.start_main_#t~ite32_Out-462944246| ~x$w_buff1~0_In-462944246)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-462944246, ~x$w_buff1~0=~x$w_buff1~0_In-462944246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-462944246, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-462944246, ~weak$$choice2~0=~weak$$choice2~0_In-462944246, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-462944246|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-462944246} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-462944246, ~x$w_buff1~0=~x$w_buff1~0_In-462944246, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-462944246, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-462944246|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-462944246, ~weak$$choice2~0=~weak$$choice2~0_In-462944246, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-462944246|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-462944246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 06:54:06,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd0~0_65 v_~x$r_buff0_thd0~0_64)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:54:06,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L806-->L809-1: Formula: (and (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_6 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~x$mem_tmp~0_7 v_~x~0_22) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:06,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:54:06,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:06 BasicIcfg [2019-12-27 06:54:06,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:06,364 INFO L168 Benchmark]: Toolchain (without parser) took 13666.34 ms. Allocated memory was 146.3 MB in the beginning and 449.3 MB in the end (delta: 303.0 MB). Free memory was 102.8 MB in the beginning and 262.7 MB in the end (delta: -159.9 MB). Peak memory consumption was 143.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,365 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,366 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.13 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 158.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.82 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,367 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,368 INFO L168 Benchmark]: RCFGBuilder took 793.71 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 108.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,369 INFO L168 Benchmark]: TraceAbstraction took 12007.16 ms. Allocated memory was 203.9 MB in the beginning and 449.3 MB in the end (delta: 245.4 MB). Free memory was 108.9 MB in the beginning and 262.7 MB in the end (delta: -153.8 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:06,373 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.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.13 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.6 MB in the beginning and 158.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.82 ms. Allocated memory is still 203.9 MB. Free memory was 158.4 MB in the beginning and 155.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.19 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 153.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 793.71 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 108.9 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12007.16 ms. Allocated memory was 203.9 MB in the beginning and 449.3 MB in the end (delta: 245.4 MB). Free memory was 108.9 MB in the beginning and 262.7 MB in the end (delta: -153.8 MB). Peak memory consumption was 91.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 146 ProgramPointsBefore, 80 ProgramPointsAfterwards, 180 TransitionsBefore, 93 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 24 ChoiceCompositions, 3674 VarBasedMoverChecksPositive, 148 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48801 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1181 SDtfs, 1601 SDslu, 3417 SDs, 0 SdLazy, 2729 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 15 SyntacticMatches, 17 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 1024 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 103840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...