/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:27:53,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:27:53,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:27:53,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:27:53,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:27:53,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:27:53,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:27:53,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:27:53,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:27:53,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:27:53,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:27:53,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:27:53,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:27:53,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:27:53,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:27:53,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:27:53,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:27:53,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:27:53,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:27:53,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:27:53,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:27:53,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:27:53,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:27:53,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:27:53,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:27:53,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:27:53,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:27:53,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:27:53,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:27:53,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:27:53,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:27:53,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:27:53,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:27:53,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:27:53,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:27:53,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:27:53,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:27:53,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:27:53,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:27:53,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:27:53,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:27:53,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:27:53,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:27:53,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:27:53,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:27:53,509 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:27:53,509 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:27:53,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:27:53,509 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:27:53,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:27:53,511 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:27:53,511 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:27:53,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:27:53,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:27:53,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:27:53,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:27:53,512 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:27:53,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:27:53,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:27:53,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:27:53,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:27:53,514 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:27:53,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:27:53,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:27:53,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:27:53,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:27:53,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:27:53,826 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:27:53,828 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2019-12-27 17:27:53,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acda7ec2/8c266527ec7a4b8088f17885e0bca8a7/FLAG0d446ab15 [2019-12-27 17:27:54,415 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:27:54,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2019-12-27 17:27:54,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acda7ec2/8c266527ec7a4b8088f17885e0bca8a7/FLAG0d446ab15 [2019-12-27 17:27:54,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5acda7ec2/8c266527ec7a4b8088f17885e0bca8a7 [2019-12-27 17:27:54,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:27:54,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:27:54,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:27:54,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:27:54,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:27:54,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:27:54" (1/1) ... [2019-12-27 17:27:54,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfdc9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:54, skipping insertion in model container [2019-12-27 17:27:54,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:27:54" (1/1) ... [2019-12-27 17:27:54,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:27:54,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:27:55,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:27:55,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:27:55,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:27:55,538 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:27:55,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55 WrapperNode [2019-12-27 17:27:55,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:27:55,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:27:55,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:27:55,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:27:55,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:27:55,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:27:55,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:27:55,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:27:55,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (1/1) ... [2019-12-27 17:27:55,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:27:55,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:27:55,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:27:55,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:27:55,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (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 17:27:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:27:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:27:55,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:27:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:27:55,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:27:55,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:27:55,712 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:27:55,713 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:27:55,713 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:27:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:27:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:27:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:27:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:27:55,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:27:55,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:27:55,717 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 17:27:56,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:27:56,427 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:27:56,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:27:56 BoogieIcfgContainer [2019-12-27 17:27:56,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:27:56,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:27:56,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:27:56,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:27:56,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:27:54" (1/3) ... [2019-12-27 17:27:56,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf386b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:27:56, skipping insertion in model container [2019-12-27 17:27:56,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:27:55" (2/3) ... [2019-12-27 17:27:56,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cf386b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:27:56, skipping insertion in model container [2019-12-27 17:27:56,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:27:56" (3/3) ... [2019-12-27 17:27:56,438 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_rmo.opt.i [2019-12-27 17:27:56,449 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:27:56,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:27:56,460 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:27:56,461 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:27:56,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,516 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,558 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,560 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,590 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,596 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,598 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,598 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,598 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,600 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,603 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:27:56,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:27:56,639 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:27:56,639 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:27:56,639 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:27:56,639 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:27:56,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:27:56,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:27:56,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:27:56,640 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:27:56,656 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-27 17:27:56,658 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-27 17:27:56,753 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-27 17:27:56,753 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:27:56,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 17:27:56,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-27 17:27:56,841 INFO L132 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-27 17:27:56,841 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:27:56,848 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 348 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 17:27:56,866 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 17:27:56,868 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:28:02,139 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 17:28:02,520 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 17:28:02,637 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 17:28:02,657 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48182 [2019-12-27 17:28:02,657 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-27 17:28:02,660 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 86 transitions [2019-12-27 17:28:04,216 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25454 states. [2019-12-27 17:28:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states. [2019-12-27 17:28:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:28:04,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:04,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:04,226 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1973922445, now seen corresponding path program 1 times [2019-12-27 17:28:04,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746739776] [2019-12-27 17:28:04,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:04,488 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 17:28:04,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746739776] [2019-12-27 17:28:04,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:04,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:28:04,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1156101230] [2019-12-27 17:28:04,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:04,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:04,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:28:04,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:04,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:04,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:04,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:04,534 INFO L87 Difference]: Start difference. First operand 25454 states. Second operand 3 states. [2019-12-27 17:28:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:05,912 INFO L93 Difference]: Finished difference Result 24966 states and 109408 transitions. [2019-12-27 17:28:05,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:05,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:28:05,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:06,173 INFO L225 Difference]: With dead ends: 24966 [2019-12-27 17:28:06,173 INFO L226 Difference]: Without dead ends: 23406 [2019-12-27 17:28:06,175 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 17:28:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23406 states. [2019-12-27 17:28:07,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23406 to 23406. [2019-12-27 17:28:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23406 states. [2019-12-27 17:28:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 102424 transitions. [2019-12-27 17:28:07,415 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 102424 transitions. Word has length 9 [2019-12-27 17:28:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:07,416 INFO L462 AbstractCegarLoop]: Abstraction has 23406 states and 102424 transitions. [2019-12-27 17:28:07,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 102424 transitions. [2019-12-27 17:28:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:28:07,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:07,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:07,429 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:07,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:07,429 INFO L82 PathProgramCache]: Analyzing trace with hash 918860120, now seen corresponding path program 1 times [2019-12-27 17:28:07,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:07,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429327285] [2019-12-27 17:28:07,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:07,539 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 17:28:07,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429327285] [2019-12-27 17:28:07,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:07,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:07,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339277933] [2019-12-27 17:28:07,542 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:07,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:07,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:28:07,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:07,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:07,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:07,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:07,551 INFO L87 Difference]: Start difference. First operand 23406 states and 102424 transitions. Second operand 3 states. [2019-12-27 17:28:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:07,857 INFO L93 Difference]: Finished difference Result 18741 states and 76288 transitions. [2019-12-27 17:28:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:07,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:28:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:07,943 INFO L225 Difference]: With dead ends: 18741 [2019-12-27 17:28:07,944 INFO L226 Difference]: Without dead ends: 18741 [2019-12-27 17:28:07,948 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 17:28:09,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18741 states. [2019-12-27 17:28:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18741 to 18741. [2019-12-27 17:28:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18741 states. [2019-12-27 17:28:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18741 states to 18741 states and 76288 transitions. [2019-12-27 17:28:09,901 INFO L78 Accepts]: Start accepts. Automaton has 18741 states and 76288 transitions. Word has length 15 [2019-12-27 17:28:09,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:09,901 INFO L462 AbstractCegarLoop]: Abstraction has 18741 states and 76288 transitions. [2019-12-27 17:28:09,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 18741 states and 76288 transitions. [2019-12-27 17:28:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:28:09,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:09,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:09,906 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash -186823823, now seen corresponding path program 1 times [2019-12-27 17:28:09,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:09,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412278428] [2019-12-27 17:28:09,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:10,025 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 17:28:10,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412278428] [2019-12-27 17:28:10,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:10,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:10,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [486816563] [2019-12-27 17:28:10,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:10,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:10,032 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:28:10,032 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:10,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:10,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:10,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:10,071 INFO L87 Difference]: Start difference. First operand 18741 states and 76288 transitions. Second operand 5 states. [2019-12-27 17:28:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:10,191 INFO L93 Difference]: Finished difference Result 8735 states and 30238 transitions. [2019-12-27 17:28:10,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:10,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 17:28:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:10,218 INFO L225 Difference]: With dead ends: 8735 [2019-12-27 17:28:10,218 INFO L226 Difference]: Without dead ends: 8735 [2019-12-27 17:28:10,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-12-27 17:28:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 8735. [2019-12-27 17:28:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8735 states. [2019-12-27 17:28:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 30238 transitions. [2019-12-27 17:28:10,648 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 30238 transitions. Word has length 16 [2019-12-27 17:28:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:10,648 INFO L462 AbstractCegarLoop]: Abstraction has 8735 states and 30238 transitions. [2019-12-27 17:28:10,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 30238 transitions. [2019-12-27 17:28:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:28:10,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:10,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:10,651 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1930084165, now seen corresponding path program 1 times [2019-12-27 17:28:10,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834438421] [2019-12-27 17:28:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:10,719 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 17:28:10,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834438421] [2019-12-27 17:28:10,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:10,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:28:10,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000897384] [2019-12-27 17:28:10,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:10,726 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:10,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:28:10,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:10,752 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:10,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:28:10,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:28:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:10,753 INFO L87 Difference]: Start difference. First operand 8735 states and 30238 transitions. Second operand 6 states. [2019-12-27 17:28:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:10,831 INFO L93 Difference]: Finished difference Result 2694 states and 8482 transitions. [2019-12-27 17:28:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:10,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:28:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:10,838 INFO L225 Difference]: With dead ends: 2694 [2019-12-27 17:28:10,839 INFO L226 Difference]: Without dead ends: 2694 [2019-12-27 17:28:10,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-12-27 17:28:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2694. [2019-12-27 17:28:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2019-12-27 17:28:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 8482 transitions. [2019-12-27 17:28:10,898 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 8482 transitions. Word has length 17 [2019-12-27 17:28:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:10,899 INFO L462 AbstractCegarLoop]: Abstraction has 2694 states and 8482 transitions. [2019-12-27 17:28:10,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:28:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 8482 transitions. [2019-12-27 17:28:10,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:28:10,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:10,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:10,902 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:10,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1944850996, now seen corresponding path program 1 times [2019-12-27 17:28:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:10,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785881839] [2019-12-27 17:28:10,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:10,942 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 17:28:10,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785881839] [2019-12-27 17:28:10,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:10,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:10,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136871560] [2019-12-27 17:28:10,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:10,945 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:10,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:28:10,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:10,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:28:10,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:10,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:10,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:10,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:10,979 INFO L87 Difference]: Start difference. First operand 2694 states and 8482 transitions. Second operand 5 states. [2019-12-27 17:28:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:11,097 INFO L93 Difference]: Finished difference Result 3870 states and 11760 transitions. [2019-12-27 17:28:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:11,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:28:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:11,106 INFO L225 Difference]: With dead ends: 3870 [2019-12-27 17:28:11,106 INFO L226 Difference]: Without dead ends: 3870 [2019-12-27 17:28:11,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2019-12-27 17:28:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 3162. [2019-12-27 17:28:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-12-27 17:28:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 9820 transitions. [2019-12-27 17:28:11,188 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 9820 transitions. Word has length 18 [2019-12-27 17:28:11,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:11,188 INFO L462 AbstractCegarLoop]: Abstraction has 3162 states and 9820 transitions. [2019-12-27 17:28:11,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:11,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 9820 transitions. [2019-12-27 17:28:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:28:11,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:11,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:11,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1944972733, now seen corresponding path program 1 times [2019-12-27 17:28:11,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:11,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400813600] [2019-12-27 17:28:11,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:11,253 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 17:28:11,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400813600] [2019-12-27 17:28:11,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:11,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:11,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351681137] [2019-12-27 17:28:11,255 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:11,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:11,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:28:11,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:11,286 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:11,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:11,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:11,288 INFO L87 Difference]: Start difference. First operand 3162 states and 9820 transitions. Second operand 5 states. [2019-12-27 17:28:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:11,456 INFO L93 Difference]: Finished difference Result 4044 states and 12266 transitions. [2019-12-27 17:28:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:11,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:28:11,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:11,464 INFO L225 Difference]: With dead ends: 4044 [2019-12-27 17:28:11,465 INFO L226 Difference]: Without dead ends: 4044 [2019-12-27 17:28:11,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4044 states. [2019-12-27 17:28:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4044 to 3838. [2019-12-27 17:28:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3838 states. [2019-12-27 17:28:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 11816 transitions. [2019-12-27 17:28:11,560 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 11816 transitions. Word has length 18 [2019-12-27 17:28:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:11,560 INFO L462 AbstractCegarLoop]: Abstraction has 3838 states and 11816 transitions. [2019-12-27 17:28:11,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 11816 transitions. [2019-12-27 17:28:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:28:11,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:11,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:28:11,566 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:11,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:11,566 INFO L82 PathProgramCache]: Analyzing trace with hash -760266034, now seen corresponding path program 1 times [2019-12-27 17:28:11,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:11,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269911402] [2019-12-27 17:28:11,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:11,618 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 17:28:11,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269911402] [2019-12-27 17:28:11,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:11,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:11,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [619789920] [2019-12-27 17:28:11,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:11,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:11,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:28:11,629 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:11,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:28:11,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:11,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:11,649 INFO L87 Difference]: Start difference. First operand 3838 states and 11816 transitions. Second operand 5 states. [2019-12-27 17:28:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:11,872 INFO L93 Difference]: Finished difference Result 4824 states and 14628 transitions. [2019-12-27 17:28:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:28:11,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:28:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:11,881 INFO L225 Difference]: With dead ends: 4824 [2019-12-27 17:28:11,881 INFO L226 Difference]: Without dead ends: 4824 [2019-12-27 17:28:11,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-27 17:28:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4055. [2019-12-27 17:28:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4055 states. [2019-12-27 17:28:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 12506 transitions. [2019-12-27 17:28:11,969 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 12506 transitions. Word has length 18 [2019-12-27 17:28:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:11,969 INFO L462 AbstractCegarLoop]: Abstraction has 4055 states and 12506 transitions. [2019-12-27 17:28:11,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 12506 transitions. [2019-12-27 17:28:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 17:28:11,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:11,980 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] [2019-12-27 17:28:11,980 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:11,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash 882681234, now seen corresponding path program 1 times [2019-12-27 17:28:11,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:11,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693390647] [2019-12-27 17:28:11,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:12,083 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 17:28:12,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693390647] [2019-12-27 17:28:12,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:12,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:28:12,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205914241] [2019-12-27 17:28:12,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:12,090 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:12,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 336 transitions. [2019-12-27 17:28:12,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:12,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:28:12,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:28:12,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:12,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:28:12,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:28:12,348 INFO L87 Difference]: Start difference. First operand 4055 states and 12506 transitions. Second operand 8 states. [2019-12-27 17:28:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:12,430 INFO L93 Difference]: Finished difference Result 3144 states and 10159 transitions. [2019-12-27 17:28:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:28:12,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-12-27 17:28:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:12,438 INFO L225 Difference]: With dead ends: 3144 [2019-12-27 17:28:12,438 INFO L226 Difference]: Without dead ends: 3144 [2019-12-27 17:28:12,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:28:12,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2019-12-27 17:28:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2944. [2019-12-27 17:28:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-27 17:28:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 9559 transitions. [2019-12-27 17:28:12,517 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 9559 transitions. Word has length 32 [2019-12-27 17:28:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:12,517 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 9559 transitions. [2019-12-27 17:28:12,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:28:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 9559 transitions. [2019-12-27 17:28:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:28:12,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:12,529 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] [2019-12-27 17:28:12,530 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1547273410, now seen corresponding path program 1 times [2019-12-27 17:28:12,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:12,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347684049] [2019-12-27 17:28:12,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:12,615 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 17:28:12,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347684049] [2019-12-27 17:28:12,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:12,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:28:12,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1529851207] [2019-12-27 17:28:12,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:12,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:12,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 292 transitions. [2019-12-27 17:28:12,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:12,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:28:12,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:28:12,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:28:12,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:28:12,764 INFO L87 Difference]: Start difference. First operand 2944 states and 9559 transitions. Second operand 5 states. [2019-12-27 17:28:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:12,805 INFO L93 Difference]: Finished difference Result 4140 states and 12859 transitions. [2019-12-27 17:28:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:12,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 17:28:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:12,812 INFO L225 Difference]: With dead ends: 4140 [2019-12-27 17:28:12,812 INFO L226 Difference]: Without dead ends: 2658 [2019-12-27 17:28:12,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:28:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states. [2019-12-27 17:28:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 2658. [2019-12-27 17:28:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-12-27 17:28:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 8505 transitions. [2019-12-27 17:28:12,867 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 8505 transitions. Word has length 47 [2019-12-27 17:28:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:12,867 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 8505 transitions. [2019-12-27 17:28:12,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:28:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 8505 transitions. [2019-12-27 17:28:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:28:12,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:12,876 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] [2019-12-27 17:28:12,877 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:12,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:12,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1022183476, now seen corresponding path program 2 times [2019-12-27 17:28:12,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:12,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432900767] [2019-12-27 17:28:12,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:28:12,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432900767] [2019-12-27 17:28:12,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:12,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:12,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886594984] [2019-12-27 17:28:12,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:12,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:13,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 373 transitions. [2019-12-27 17:28:13,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:13,436 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-27 17:28:13,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:28:13,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:13,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:13,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:13,438 INFO L87 Difference]: Start difference. First operand 2658 states and 8505 transitions. Second operand 4 states. [2019-12-27 17:28:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:13,581 INFO L93 Difference]: Finished difference Result 4173 states and 12631 transitions. [2019-12-27 17:28:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:13,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 17:28:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:13,588 INFO L225 Difference]: With dead ends: 4173 [2019-12-27 17:28:13,589 INFO L226 Difference]: Without dead ends: 2504 [2019-12-27 17:28:13,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-12-27 17:28:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 1930. [2019-12-27 17:28:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1930 states. [2019-12-27 17:28:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 5542 transitions. [2019-12-27 17:28:13,630 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 5542 transitions. Word has length 47 [2019-12-27 17:28:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:13,630 INFO L462 AbstractCegarLoop]: Abstraction has 1930 states and 5542 transitions. [2019-12-27 17:28:13,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 5542 transitions. [2019-12-27 17:28:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:28:13,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:13,638 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] [2019-12-27 17:28:13,638 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash -210383636, now seen corresponding path program 3 times [2019-12-27 17:28:13,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:13,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728731023] [2019-12-27 17:28:13,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:13,734 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 17:28:13,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728731023] [2019-12-27 17:28:13,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:13,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:13,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638693441] [2019-12-27 17:28:13,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:13,748 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:13,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 392 transitions. [2019-12-27 17:28:13,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:13,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:28:13,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:28:13,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:28:13,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:28:13,864 INFO L87 Difference]: Start difference. First operand 1930 states and 5542 transitions. Second operand 4 states. [2019-12-27 17:28:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:14,011 INFO L93 Difference]: Finished difference Result 3259 states and 9125 transitions. [2019-12-27 17:28:14,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:28:14,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 17:28:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:14,013 INFO L225 Difference]: With dead ends: 3259 [2019-12-27 17:28:14,013 INFO L226 Difference]: Without dead ends: 749 [2019-12-27 17:28:14,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 17:28:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-12-27 17:28:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 490. [2019-12-27 17:28:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-27 17:28:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1104 transitions. [2019-12-27 17:28:14,023 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1104 transitions. Word has length 47 [2019-12-27 17:28:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:14,023 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1104 transitions. [2019-12-27 17:28:14,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:28:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1104 transitions. [2019-12-27 17:28:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:28:14,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:14,026 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] [2019-12-27 17:28:14,026 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:14,026 INFO L82 PathProgramCache]: Analyzing trace with hash -493161086, now seen corresponding path program 4 times [2019-12-27 17:28:14,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:14,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609252251] [2019-12-27 17:28:14,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:14,110 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 17:28:14,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609252251] [2019-12-27 17:28:14,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:14,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:28:14,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788499350] [2019-12-27 17:28:14,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:14,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:14,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 296 transitions. [2019-12-27 17:28:14,231 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:14,261 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:28:14,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:28:14,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:28:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:28:14,263 INFO L87 Difference]: Start difference. First operand 490 states and 1104 transitions. Second operand 7 states. [2019-12-27 17:28:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:14,473 INFO L93 Difference]: Finished difference Result 890 states and 1958 transitions. [2019-12-27 17:28:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:28:14,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 17:28:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:14,475 INFO L225 Difference]: With dead ends: 890 [2019-12-27 17:28:14,475 INFO L226 Difference]: Without dead ends: 604 [2019-12-27 17:28:14,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:28:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-27 17:28:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 546. [2019-12-27 17:28:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-27 17:28:14,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1193 transitions. [2019-12-27 17:28:14,485 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1193 transitions. Word has length 47 [2019-12-27 17:28:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:14,485 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1193 transitions. [2019-12-27 17:28:14,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:28:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1193 transitions. [2019-12-27 17:28:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:28:14,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:14,487 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] [2019-12-27 17:28:14,487 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:14,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1709037106, now seen corresponding path program 5 times [2019-12-27 17:28:14,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:14,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117346252] [2019-12-27 17:28:14,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:28:14,561 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 17:28:14,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117346252] [2019-12-27 17:28:14,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:28:14,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:28:14,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [4993987] [2019-12-27 17:28:14,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:28:14,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:28:14,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 354 transitions. [2019-12-27 17:28:14,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:28:14,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:28:14,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:28:14,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:28:14,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:28:14,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:28:14,870 INFO L87 Difference]: Start difference. First operand 546 states and 1193 transitions. Second operand 3 states. [2019-12-27 17:28:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:28:14,887 INFO L93 Difference]: Finished difference Result 546 states and 1191 transitions. [2019-12-27 17:28:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:28:14,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 17:28:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:28:14,889 INFO L225 Difference]: With dead ends: 546 [2019-12-27 17:28:14,889 INFO L226 Difference]: Without dead ends: 546 [2019-12-27 17:28:14,889 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 17:28:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-27 17:28:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-12-27 17:28:14,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-12-27 17:28:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1191 transitions. [2019-12-27 17:28:14,897 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1191 transitions. Word has length 47 [2019-12-27 17:28:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:28:14,898 INFO L462 AbstractCegarLoop]: Abstraction has 546 states and 1191 transitions. [2019-12-27 17:28:14,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:28:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1191 transitions. [2019-12-27 17:28:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 17:28:14,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:28:14,899 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] [2019-12-27 17:28:14,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:28:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:28:14,900 INFO L82 PathProgramCache]: Analyzing trace with hash 81842901, now seen corresponding path program 1 times [2019-12-27 17:28:14,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:28:14,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375316568] [2019-12-27 17:28:14,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:28:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:28:15,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:28:15,064 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:28:15,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1429~0.base_44|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44| 1) |v_#valid_89|) (= 0 v_~z$r_buff1_thd4~0_125) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1429~0.base_44| 4) |v_#length_29|) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44|)) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44|) |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_45, ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_44|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_36|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_27|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ULTIMATE.start_main_~#t1429~0.base=|v_ULTIMATE.start_main_~#t1429~0.base_44|, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1429~0.offset=|v_ULTIMATE.start_main_~#t1429~0.offset_29|, ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t1430~0.base, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1430~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t1431~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1432~0.base, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1429~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1429~0.offset, ULTIMATE.start_main_~#t1432~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:28:15,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12|) |v_ULTIMATE.start_main_~#t1430~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1430~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1430~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1430~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1430~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1430~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1430~0.offset, #length] because there is no mapped edge [2019-12-27 17:28:15,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1431~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11|) |v_ULTIMATE.start_main_~#t1431~0.offset_10| 2))) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1431~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1431~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1431~0.base, #length] because there is no mapped edge [2019-12-27 17:28:15,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12|) |v_ULTIMATE.start_main_~#t1432~0.offset_10| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1432~0.base_12| 4)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1432~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1432~0.base_12| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1432~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1432~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1432~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 17:28:15,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork1_~arg.base_15 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= 0 (mod v_~z$w_buff1_used~0_70 256)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| 1) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_17) (= v_P3Thread1of1ForFork1_~arg.offset_15 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_15|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_15, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 17:28:15,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_24 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_24) (= v_~a~0_34 1) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_24, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_24} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:28:15,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_15) (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_15) (= v_~y~0_33 1) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_15, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_15, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-27 17:28:15,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1534007867 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1534007867 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out1534007867|)) (and (= ~z$w_buff0_used~0_In1534007867 |P3Thread1of1ForFork1_#t~ite28_Out1534007867|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1534007867, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1534007867} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1534007867, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1534007867|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1534007867} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:28:15,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-364396756 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-364396756 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-364396756 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-364396756 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-364396756 |P3Thread1of1ForFork1_#t~ite29_Out-364396756|)) (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-364396756|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-364396756, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364396756, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-364396756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364396756} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-364396756, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-364396756|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-364396756, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-364396756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-364396756} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 17:28:15,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1073828068 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1073828068 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1073828068 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1073828068 ~z$r_buff0_thd4~0_In1073828068) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1073828068, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1073828068} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1073828068, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1073828068, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out1073828068|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:28:15,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-1378112898 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1378112898 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1378112898 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1378112898 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1378112898 |P3Thread1of1ForFork1_#t~ite31_Out-1378112898|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out-1378112898|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1378112898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378112898, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1378112898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378112898} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1378112898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1378112898, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1378112898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1378112898, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-1378112898|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:28:15,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1230142072 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite11_In1230142072| |P2Thread1of1ForFork0_#t~ite11_Out1230142072|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out1230142072| ~z$w_buff1~0_In1230142072)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1230142072 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1230142072 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1230142072 256)) (and (= (mod ~z$r_buff1_thd3~0_In1230142072 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite11_Out1230142072| ~z$w_buff1~0_In1230142072) (= |P2Thread1of1ForFork0_#t~ite11_Out1230142072| |P2Thread1of1ForFork0_#t~ite12_Out1230142072|) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1230142072, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1230142072|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1230142072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1230142072, ~z$w_buff1~0=~z$w_buff1~0_In1230142072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1230142072, ~weak$$choice2~0=~weak$$choice2~0_In1230142072} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1230142072|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1230142072, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1230142072|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1230142072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1230142072, ~z$w_buff1~0=~z$w_buff1~0_In1230142072, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1230142072, ~weak$$choice2~0=~weak$$choice2~0_In1230142072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 17:28:15,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_46|) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_46|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_45|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:28:15,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 17:28:15,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:28:15,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:28:15,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-127805354 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-127805354 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite36_Out-127805354| |ULTIMATE.start_main_#t~ite37_Out-127805354|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-127805354 |ULTIMATE.start_main_#t~ite36_Out-127805354|) .cse2) (and (= ~z~0_In-127805354 |ULTIMATE.start_main_#t~ite36_Out-127805354|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-127805354, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-127805354, ~z$w_buff1~0=~z$w_buff1~0_In-127805354, ~z~0=~z~0_In-127805354} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-127805354, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-127805354, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-127805354|, ~z$w_buff1~0=~z$w_buff1~0_In-127805354, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-127805354|, ~z~0=~z~0_In-127805354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:28:15,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1147348555 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1147348555 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1147348555 |ULTIMATE.start_main_#t~ite38_Out-1147348555|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1147348555|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1147348555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147348555} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1147348555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1147348555, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1147348555|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:28:15,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2042059139 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2042059139 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2042059139 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2042059139 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out2042059139| ~z$w_buff1_used~0_In2042059139)) (and (= |ULTIMATE.start_main_#t~ite39_Out2042059139| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2042059139, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2042059139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2042059139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2042059139} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2042059139, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2042059139|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2042059139, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2042059139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2042059139} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:28:15,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1381135102 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1381135102 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-1381135102|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1381135102 |ULTIMATE.start_main_#t~ite40_Out-1381135102|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1381135102, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1381135102} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1381135102, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1381135102|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1381135102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:28:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In2132022758 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2132022758 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2132022758 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2132022758 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out2132022758|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In2132022758 |ULTIMATE.start_main_#t~ite41_Out2132022758|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2132022758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2132022758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2132022758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132022758} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2132022758|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2132022758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2132022758, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2132022758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132022758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 17:28:15,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_52 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:28:15,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:28:15 BasicIcfg [2019-12-27 17:28:15,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:28:15,224 INFO L168 Benchmark]: Toolchain (without parser) took 20480.48 ms. Allocated memory was 138.9 MB in the beginning and 1.1 GB in the end (delta: 961.5 MB). Free memory was 100.4 MB in the beginning and 591.2 MB in the end (delta: -490.9 MB). Peak memory consumption was 470.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,226 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.63 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,228 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,228 INFO L168 Benchmark]: RCFGBuilder took 784.62 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 106.4 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,229 INFO L168 Benchmark]: TraceAbstraction took 18789.03 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 897.6 MB). Free memory was 105.7 MB in the beginning and 591.2 MB in the end (delta: -485.5 MB). Peak memory consumption was 412.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:28:15,232 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.63 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 156.5 MB in the end (delta: -56.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.29 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.62 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 106.4 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18789.03 ms. Allocated memory was 202.9 MB in the beginning and 1.1 GB in the end (delta: 897.6 MB). Free memory was 105.7 MB in the beginning and 591.2 MB in the end (delta: -485.5 MB). Peak memory consumption was 412.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 167 ProgramPointsBefore, 78 ProgramPointsAfterwards, 189 TransitionsBefore, 86 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 19 ChoiceCompositions, 5650 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 185 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 48182 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1429, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1430, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1431, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1432, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L772] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L774] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1436 SDtfs, 2304 SDslu, 2230 SDs, 0 SdLazy, 709 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25454occurred 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: 4.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 2774 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 33649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...