/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:17:04,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:17:04,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:17:04,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:17:04,548 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:17:04,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:17:04,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:17:04,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:17:04,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:17:04,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:17:04,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:17:04,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:17:04,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:17:04,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:17:04,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:17:04,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:17:04,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:17:04,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:17:04,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:17:04,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:17:04,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:17:04,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:17:04,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:17:04,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:17:04,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:17:04,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:17:04,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:17:04,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:17:04,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:17:04,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:17:04,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:17:04,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:17:04,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:17:04,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:17:04,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:17:04,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:17:04,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:17:04,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:17:04,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:17:04,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:17:04,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:17:04,584 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.epf [2019-12-27 02:17:04,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:17:04,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:17:04,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:17:04,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:17:04,607 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:17:04,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:17:04,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:17:04,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:17:04,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:17:04,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:17:04,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:17:04,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:17:04,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:17:04,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:17:04,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:17:04,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:17:04,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:17:04,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:17:04,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:17:04,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:17:04,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:17:04,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:17:04,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:17:04,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:17:04,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:17:04,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:17:04,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:17:04,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:17:04,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:17:04,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:17:04,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:17:04,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:17:04,918 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:17:04,918 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:17:04,919 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2019-12-27 02:17:04,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/830a45e9d/090d5214bcfc4121baa9c9739071da51/FLAG314306928 [2019-12-27 02:17:05,549 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:17:05,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2019-12-27 02:17:05,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/830a45e9d/090d5214bcfc4121baa9c9739071da51/FLAG314306928 [2019-12-27 02:17:05,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/830a45e9d/090d5214bcfc4121baa9c9739071da51 [2019-12-27 02:17:05,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:17:05,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:17:05,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:17:05,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:17:05,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:17:05,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:17:05" (1/1) ... [2019-12-27 02:17:05,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ede1650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:05, skipping insertion in model container [2019-12-27 02:17:05,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:17:05" (1/1) ... [2019-12-27 02:17:05,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:17:05,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:17:06,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:17:06,500 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:17:06,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:17:06,631 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:17:06,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06 WrapperNode [2019-12-27 02:17:06,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:17:06,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:17:06,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:17:06,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:17:06,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:17:06,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:17:06,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:17:06,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:17:06,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (1/1) ... [2019-12-27 02:17:06,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:17:06,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:17:06,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:17:06,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:17:06,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (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 02:17:06,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:17:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:17:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:17:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:17:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:17:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:17:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:17:06,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:17:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:17:06,806 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:17:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:17:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:17:06,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:17:06,808 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 02:17:07,492 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:17:07,492 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:17:07,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:17:07 BoogieIcfgContainer [2019-12-27 02:17:07,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:17:07,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:17:07,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:17:07,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:17:07,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:17:05" (1/3) ... [2019-12-27 02:17:07,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a506bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:17:07, skipping insertion in model container [2019-12-27 02:17:07,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:17:06" (2/3) ... [2019-12-27 02:17:07,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a506bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:17:07, skipping insertion in model container [2019-12-27 02:17:07,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:17:07" (3/3) ... [2019-12-27 02:17:07,503 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt.i [2019-12-27 02:17:07,514 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:17:07,514 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:17:07,522 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:17:07,523 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:17:07,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,566 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,606 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,610 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,611 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,618 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,659 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,660 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:17:07,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:17:07,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:17:07,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:17:07,698 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:17:07,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:17:07,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:17:07,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:17:07,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:17:07,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:17:07,715 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-27 02:17:07,717 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 02:17:07,822 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 02:17:07,823 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:17:07,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 02:17:07,858 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-27 02:17:07,933 INFO L132 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-27 02:17:07,934 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:17:07,939 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 02:17:07,953 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 02:17:07,954 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:17:12,827 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:17:12,984 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:17:13,163 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39797 [2019-12-27 02:17:13,163 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 02:17:13,167 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 78 transitions [2019-12-27 02:17:13,830 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 11878 states. [2019-12-27 02:17:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states. [2019-12-27 02:17:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 02:17:13,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:13,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:13,841 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:13,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -884972408, now seen corresponding path program 1 times [2019-12-27 02:17:13,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:13,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175119469] [2019-12-27 02:17:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:14,114 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 02:17:14,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175119469] [2019-12-27 02:17:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:14,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:17:14,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797726231] [2019-12-27 02:17:14,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:14,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:14,147 INFO L87 Difference]: Start difference. First operand 11878 states. Second operand 3 states. [2019-12-27 02:17:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:14,550 INFO L93 Difference]: Finished difference Result 11574 states and 44420 transitions. [2019-12-27 02:17:14,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:14,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 02:17:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:14,694 INFO L225 Difference]: With dead ends: 11574 [2019-12-27 02:17:14,694 INFO L226 Difference]: Without dead ends: 10902 [2019-12-27 02:17:14,698 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 02:17:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-27 02:17:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-27 02:17:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-27 02:17:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 41772 transitions. [2019-12-27 02:17:15,888 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 41772 transitions. Word has length 7 [2019-12-27 02:17:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:15,889 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 41772 transitions. [2019-12-27 02:17:15,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:15,890 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 41772 transitions. [2019-12-27 02:17:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:17:15,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:15,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:15,902 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1826046565, now seen corresponding path program 1 times [2019-12-27 02:17:15,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:15,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030680494] [2019-12-27 02:17:15,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:16,017 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 02:17:16,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030680494] [2019-12-27 02:17:16,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:16,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:16,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446893536] [2019-12-27 02:17:16,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:16,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:16,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:16,021 INFO L87 Difference]: Start difference. First operand 10902 states and 41772 transitions. Second operand 3 states. [2019-12-27 02:17:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:16,110 INFO L93 Difference]: Finished difference Result 6581 states and 22068 transitions. [2019-12-27 02:17:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:16,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:17:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:16,162 INFO L225 Difference]: With dead ends: 6581 [2019-12-27 02:17:16,162 INFO L226 Difference]: Without dead ends: 6581 [2019-12-27 02:17:16,165 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 02:17:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-12-27 02:17:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 6581. [2019-12-27 02:17:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6581 states. [2019-12-27 02:17:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 22068 transitions. [2019-12-27 02:17:16,379 INFO L78 Accepts]: Start accepts. Automaton has 6581 states and 22068 transitions. Word has length 13 [2019-12-27 02:17:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:16,379 INFO L462 AbstractCegarLoop]: Abstraction has 6581 states and 22068 transitions. [2019-12-27 02:17:16,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6581 states and 22068 transitions. [2019-12-27 02:17:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:17:16,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:16,381 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:16,381 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:16,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:16,382 INFO L82 PathProgramCache]: Analyzing trace with hash 2047638315, now seen corresponding path program 1 times [2019-12-27 02:17:16,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:16,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890204076] [2019-12-27 02:17:16,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:16,459 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 02:17:16,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890204076] [2019-12-27 02:17:16,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:16,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:16,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627634319] [2019-12-27 02:17:16,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:16,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:16,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:16,462 INFO L87 Difference]: Start difference. First operand 6581 states and 22068 transitions. Second operand 4 states. [2019-12-27 02:17:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:16,503 INFO L93 Difference]: Finished difference Result 1580 states and 4255 transitions. [2019-12-27 02:17:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:16,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:17:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:16,508 INFO L225 Difference]: With dead ends: 1580 [2019-12-27 02:17:16,509 INFO L226 Difference]: Without dead ends: 1580 [2019-12-27 02:17:16,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2019-12-27 02:17:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2019-12-27 02:17:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2019-12-27 02:17:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 4255 transitions. [2019-12-27 02:17:16,546 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 4255 transitions. Word has length 14 [2019-12-27 02:17:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:16,546 INFO L462 AbstractCegarLoop]: Abstraction has 1580 states and 4255 transitions. [2019-12-27 02:17:16,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 4255 transitions. [2019-12-27 02:17:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:17:16,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:16,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:16,548 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 564133875, now seen corresponding path program 1 times [2019-12-27 02:17:16,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:16,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570813133] [2019-12-27 02:17:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:16,592 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 02:17:16,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570813133] [2019-12-27 02:17:16,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:16,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:16,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486256380] [2019-12-27 02:17:16,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:16,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:16,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:16,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:16,594 INFO L87 Difference]: Start difference. First operand 1580 states and 4255 transitions. Second operand 3 states. [2019-12-27 02:17:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:16,660 INFO L93 Difference]: Finished difference Result 2392 states and 6401 transitions. [2019-12-27 02:17:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:16,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 02:17:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:16,667 INFO L225 Difference]: With dead ends: 2392 [2019-12-27 02:17:16,668 INFO L226 Difference]: Without dead ends: 2392 [2019-12-27 02:17:16,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2019-12-27 02:17:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 1844. [2019-12-27 02:17:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1844 states. [2019-12-27 02:17:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 5001 transitions. [2019-12-27 02:17:16,721 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 5001 transitions. Word has length 16 [2019-12-27 02:17:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:16,721 INFO L462 AbstractCegarLoop]: Abstraction has 1844 states and 5001 transitions. [2019-12-27 02:17:16,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 5001 transitions. [2019-12-27 02:17:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:17:16,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:16,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:16,723 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:16,723 INFO L82 PathProgramCache]: Analyzing trace with hash 659196956, now seen corresponding path program 1 times [2019-12-27 02:17:16,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:16,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402025135] [2019-12-27 02:17:16,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:16,805 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 02:17:16,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402025135] [2019-12-27 02:17:16,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:16,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:16,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554187969] [2019-12-27 02:17:16,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:16,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:16,808 INFO L87 Difference]: Start difference. First operand 1844 states and 5001 transitions. Second operand 5 states. [2019-12-27 02:17:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:17,192 INFO L93 Difference]: Finished difference Result 2843 states and 7459 transitions. [2019-12-27 02:17:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:17:17,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:17:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:17,200 INFO L225 Difference]: With dead ends: 2843 [2019-12-27 02:17:17,200 INFO L226 Difference]: Without dead ends: 2843 [2019-12-27 02:17:17,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-27 02:17:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2353. [2019-12-27 02:17:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-12-27 02:17:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 6293 transitions. [2019-12-27 02:17:17,259 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 6293 transitions. Word has length 16 [2019-12-27 02:17:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 2353 states and 6293 transitions. [2019-12-27 02:17:17,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 6293 transitions. [2019-12-27 02:17:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:17:17,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,264 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] [2019-12-27 02:17:17,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1695035107, now seen corresponding path program 1 times [2019-12-27 02:17:17,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311681991] [2019-12-27 02:17:17,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,365 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 02:17:17,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311681991] [2019-12-27 02:17:17,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:17,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135869361] [2019-12-27 02:17:17,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:17,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:17,367 INFO L87 Difference]: Start difference. First operand 2353 states and 6293 transitions. Second operand 5 states. [2019-12-27 02:17:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:17,404 INFO L93 Difference]: Finished difference Result 1432 states and 3933 transitions. [2019-12-27 02:17:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:17,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 02:17:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:17,409 INFO L225 Difference]: With dead ends: 1432 [2019-12-27 02:17:17,410 INFO L226 Difference]: Without dead ends: 1432 [2019-12-27 02:17:17,410 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 02:17:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-12-27 02:17:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1360. [2019-12-27 02:17:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-12-27 02:17:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 3745 transitions. [2019-12-27 02:17:17,442 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 3745 transitions. Word has length 29 [2019-12-27 02:17:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,442 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 3745 transitions. [2019-12-27 02:17:17,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 3745 transitions. [2019-12-27 02:17:17,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:17:17,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,449 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] [2019-12-27 02:17:17,449 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -17339731, now seen corresponding path program 1 times [2019-12-27 02:17:17,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989525762] [2019-12-27 02:17:17,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,577 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 02:17:17,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989525762] [2019-12-27 02:17:17,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:17,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896259157] [2019-12-27 02:17:17,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:17,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:17,580 INFO L87 Difference]: Start difference. First operand 1360 states and 3745 transitions. Second operand 4 states. [2019-12-27 02:17:17,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:17,605 INFO L93 Difference]: Finished difference Result 1911 states and 4995 transitions. [2019-12-27 02:17:17,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:17,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 02:17:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:17,609 INFO L225 Difference]: With dead ends: 1911 [2019-12-27 02:17:17,609 INFO L226 Difference]: Without dead ends: 1220 [2019-12-27 02:17:17,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-12-27 02:17:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220. [2019-12-27 02:17:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-12-27 02:17:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 3296 transitions. [2019-12-27 02:17:17,637 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 3296 transitions. Word has length 44 [2019-12-27 02:17:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,637 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 3296 transitions. [2019-12-27 02:17:17,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 3296 transitions. [2019-12-27 02:17:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:17:17,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,641 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] [2019-12-27 02:17:17,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1927376753, now seen corresponding path program 2 times [2019-12-27 02:17:17,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011625263] [2019-12-27 02:17:17,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,705 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 02:17:17,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011625263] [2019-12-27 02:17:17,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:17,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243215391] [2019-12-27 02:17:17,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:17,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:17,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:17,708 INFO L87 Difference]: Start difference. First operand 1220 states and 3296 transitions. Second operand 3 states. [2019-12-27 02:17:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:17,724 INFO L93 Difference]: Finished difference Result 1607 states and 4203 transitions. [2019-12-27 02:17:17,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:17,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 02:17:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:17,726 INFO L225 Difference]: With dead ends: 1607 [2019-12-27 02:17:17,726 INFO L226 Difference]: Without dead ends: 419 [2019-12-27 02:17:17,727 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 02:17:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-27 02:17:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2019-12-27 02:17:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-12-27 02:17:17,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 962 transitions. [2019-12-27 02:17:17,738 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 962 transitions. Word has length 44 [2019-12-27 02:17:17,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:17,738 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 962 transitions. [2019-12-27 02:17:17,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:17,739 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 962 transitions. [2019-12-27 02:17:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:17:17,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:17,741 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] [2019-12-27 02:17:17,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash -742917265, now seen corresponding path program 3 times [2019-12-27 02:17:17,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:17,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110271705] [2019-12-27 02:17:17,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:17,846 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 02:17:17,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110271705] [2019-12-27 02:17:17,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:17,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:17:17,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872686308] [2019-12-27 02:17:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:17,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:17,849 INFO L87 Difference]: Start difference. First operand 419 states and 962 transitions. Second operand 5 states. [2019-12-27 02:17:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:18,140 INFO L93 Difference]: Finished difference Result 760 states and 1680 transitions. [2019-12-27 02:17:18,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:17:18,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 02:17:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:18,142 INFO L225 Difference]: With dead ends: 760 [2019-12-27 02:17:18,142 INFO L226 Difference]: Without dead ends: 760 [2019-12-27 02:17:18,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-27 02:17:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 718. [2019-12-27 02:17:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-12-27 02:17:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1598 transitions. [2019-12-27 02:17:18,160 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1598 transitions. Word has length 44 [2019-12-27 02:17:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:18,162 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 1598 transitions. [2019-12-27 02:17:18,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1598 transitions. [2019-12-27 02:17:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:17:18,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:18,167 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] [2019-12-27 02:17:18,167 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1532064511, now seen corresponding path program 4 times [2019-12-27 02:17:18,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:18,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323293104] [2019-12-27 02:17:18,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:18,293 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 02:17:18,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323293104] [2019-12-27 02:17:18,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:18,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:18,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575000358] [2019-12-27 02:17:18,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:18,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:18,297 INFO L87 Difference]: Start difference. First operand 718 states and 1598 transitions. Second operand 7 states. [2019-12-27 02:17:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:18,573 INFO L93 Difference]: Finished difference Result 1812 states and 3795 transitions. [2019-12-27 02:17:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:17:18,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 02:17:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:18,577 INFO L225 Difference]: With dead ends: 1812 [2019-12-27 02:17:18,577 INFO L226 Difference]: Without dead ends: 1187 [2019-12-27 02:17:18,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:17:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-27 02:17:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 750. [2019-12-27 02:17:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-12-27 02:17:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1642 transitions. [2019-12-27 02:17:18,595 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1642 transitions. Word has length 44 [2019-12-27 02:17:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:18,595 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1642 transitions. [2019-12-27 02:17:18,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1642 transitions. [2019-12-27 02:17:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 02:17:18,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:18,598 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] [2019-12-27 02:17:18,598 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash -719181347, now seen corresponding path program 5 times [2019-12-27 02:17:18,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:18,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545977702] [2019-12-27 02:17:18,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:18,733 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 02:17:18,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545977702] [2019-12-27 02:17:18,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:18,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:18,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593970106] [2019-12-27 02:17:18,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:18,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:18,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:18,735 INFO L87 Difference]: Start difference. First operand 750 states and 1642 transitions. Second operand 3 states. [2019-12-27 02:17:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:18,756 INFO L93 Difference]: Finished difference Result 748 states and 1637 transitions. [2019-12-27 02:17:18,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:18,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 02:17:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:18,760 INFO L225 Difference]: With dead ends: 748 [2019-12-27 02:17:18,760 INFO L226 Difference]: Without dead ends: 748 [2019-12-27 02:17:18,760 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 02:17:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-12-27 02:17:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 648. [2019-12-27 02:17:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-12-27 02:17:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1446 transitions. [2019-12-27 02:17:18,773 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1446 transitions. Word has length 44 [2019-12-27 02:17:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:18,774 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1446 transitions. [2019-12-27 02:17:18,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1446 transitions. [2019-12-27 02:17:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 02:17:18,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:18,776 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] [2019-12-27 02:17:18,776 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -926318759, now seen corresponding path program 1 times [2019-12-27 02:17:18,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:18,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126867624] [2019-12-27 02:17:18,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:17:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:17:18,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:17:18,939 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:17:18,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= v_~weak$$choice2~0_155 0) (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~__unbuffered_cnt~0_89) (= v_~z$w_buff1~0_237 0) (= 0 v_~z$r_buff1_thd3~0_123) (= 0 v_~__unbuffered_p2_EAX~0_85) (= |v_#NULL.offset_7| 0) (= v_~main$tmp_guard0~0_18 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_26|) |v_ULTIMATE.start_main_~#t882~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z~0_127 0) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26|)) (= v_~z$r_buff0_thd2~0_289 0) (= v_~z$read_delayed_var~0.base_4 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$w_buff0~0_373 0) (= v_~__unbuffered_p2_EBX~0_85 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t882~0.base_26| 1)) (= v_~z$read_delayed~0_5 0) (= v_~z$read_delayed_var~0.offset_4 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_24 0) (= v_~y~0_12 0) (= 0 v_~__unbuffered_p1_EAX~0_29) (= v_~z$r_buff1_thd0~0_127 0) (= v_~z$r_buff0_thd0~0_88 0) (= v_~z$w_buff1_used~0_415 0) (= 0 |v_ULTIMATE.start_main_~#t882~0.offset_19|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t882~0.base_26| 4)) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t882~0.base_26|) (= 0 |v_#NULL.base_7|) (= 0 v_~z$flush_delayed~0_41) (= v_~b~0_31 0) (= v_~z$w_buff0_used~0_644 0) (= 0 v_~z$r_buff0_thd3~0_138) (= v_~__unbuffered_p1_EBX~0_47 0) (= v_~z$r_buff1_thd2~0_233 0) (= v_~x~0_36 0) (= v_~main$tmp_guard1~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_233, #NULL.offset=|v_#NULL.offset_7|, ~a~0=v_~a~0_68, ULTIMATE.start_main_~#t882~0.base=|v_ULTIMATE.start_main_~#t882~0.base_26|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_85, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_85, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_79|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_415, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_53|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_19|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_138, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ~z$w_buff1~0=v_~z$w_buff1~0_237, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_127, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_16|, ~y~0=v_~y~0_12, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_289, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_644, ~z$w_buff0~0=v_~z$w_buff0~0_373, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_123, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_77|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_16|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t882~0.offset=|v_ULTIMATE.start_main_~#t882~0.offset_19|, ~b~0=v_~b~0_31, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_155, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t882~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~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_~#t883~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t884~0.base, ~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_~#t884~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~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, ULTIMATE.start_main_~#t883~0.offset, #NULL.base, ULTIMATE.start_main_~#t882~0.offset, ~b~0, 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 02:17:18,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L830-1-->L832: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t883~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t883~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t883~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11|) |v_ULTIMATE.start_main_~#t883~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11| 1) |v_#valid_39|) (not (= 0 |v_ULTIMATE.start_main_~#t883~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t883~0.base, #length, ULTIMATE.start_main_~#t883~0.offset] because there is no mapped edge [2019-12-27 02:17:18,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t884~0.base_13|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t884~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13|) |v_ULTIMATE.start_main_~#t884~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t884~0.offset_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t884~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t884~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t884~0.offset, #length] because there is no mapped edge [2019-12-27 02:17:18,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= v_~z$r_buff0_thd3~0_39 1) (= v_~__unbuffered_p2_EBX~0_7 v_~b~0_7) (= v_~z$r_buff0_thd2~0_71 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_20 v_~z$r_buff1_thd0~0_19) (= v_~z$r_buff0_thd3~0_40 v_~z$r_buff1_thd3~0_26) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24)) (= 1 v_~a~0_6) (= v_~__unbuffered_p2_EAX~0_7 v_~a~0_6)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_24, ~a~0=v_~a~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~b~0=v_~b~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_19, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-27 02:17:18,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_22 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x~0_18 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_18, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:17:18,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In346054134 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In346054134| |P1Thread1of1ForFork1_#t~ite14_Out346054134|) (= |P1Thread1of1ForFork1_#t~ite15_Out346054134| ~z$w_buff0_used~0_In346054134) (not .cse0)) (and (= ~z$w_buff0_used~0_In346054134 |P1Thread1of1ForFork1_#t~ite14_Out346054134|) (= |P1Thread1of1ForFork1_#t~ite15_Out346054134| |P1Thread1of1ForFork1_#t~ite14_Out346054134|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In346054134 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In346054134 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In346054134 256)) (and (= (mod ~z$w_buff1_used~0_In346054134 256) 0) .cse1))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In346054134, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In346054134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346054134, ~weak$$choice2~0=~weak$$choice2~0_In346054134, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In346054134, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In346054134|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In346054134, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In346054134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In346054134, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out346054134|, ~weak$$choice2~0=~weak$$choice2~0_In346054134, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out346054134|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In346054134} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:17:18,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (= v_~z$r_buff0_thd2~0_113 v_~z$r_buff0_thd2~0_112) (not (= (mod v_~weak$$choice2~0_37 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_113} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_15|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_37, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:17:18,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_13 256) 0)) (= 0 v_~z$flush_delayed~0_12) (= v_~z~0_41 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~z$flush_delayed~0=v_~z$flush_delayed~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~z~0=v_~z~0_41, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 02:17:18,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1755978277 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1755978277 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1755978277| ~z$w_buff0_used~0_In1755978277)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out1755978277| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1755978277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1755978277} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1755978277, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1755978277, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1755978277|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:17:18,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-1525602011 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1525602011 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1525602011 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1525602011 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1525602011| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1525602011 |P2Thread1of1ForFork2_#t~ite29_Out-1525602011|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525602011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1525602011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525602011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1525602011} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1525602011, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1525602011, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1525602011, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1525602011, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1525602011|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:17:18,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1335433040 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1335433040 256) 0))) (or (and (= ~z$r_buff0_thd3~0_Out1335433040 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_Out1335433040 ~z$r_buff0_thd3~0_In1335433040)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1335433040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1335433040} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1335433040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1335433040, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1335433040} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 02:17:18,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1510269296 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1510269296 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1510269296 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd3~0_In1510269296 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1510269296|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1510269296 |P2Thread1of1ForFork2_#t~ite31_Out1510269296|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1510269296, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1510269296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510269296, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1510269296} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1510269296|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510269296, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1510269296, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510269296, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1510269296} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:17:18,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~z$r_buff1_thd3~0_49) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_49, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 02:17:18,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:17:18,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1185991623 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1185991623 256)))) (or (and (= ~z~0_In-1185991623 |ULTIMATE.start_main_#t~ite35_Out-1185991623|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-1185991623 |ULTIMATE.start_main_#t~ite35_Out-1185991623|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1185991623, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1185991623, ~z$w_buff1~0=~z$w_buff1~0_In-1185991623, ~z~0=~z~0_In-1185991623} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1185991623, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1185991623|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1185991623, ~z$w_buff1~0=~z$w_buff1~0_In-1185991623, ~z~0=~z~0_In-1185991623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 02:17:18,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite35_22|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_22|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_19|, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-27 02:17:18,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In810385673 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In810385673 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_Out810385673| 0)) (and (= ~z$w_buff0_used~0_In810385673 |ULTIMATE.start_main_#t~ite37_Out810385673|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In810385673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In810385673} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In810385673, ~z$w_buff0_used~0=~z$w_buff0_used~0_In810385673, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out810385673|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:17:18,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1735007865 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1735007865 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1735007865 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1735007865 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out-1735007865| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1735007865| ~z$w_buff1_used~0_In-1735007865)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735007865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735007865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1735007865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735007865} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735007865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735007865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1735007865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735007865, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1735007865|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:17:18,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-401000586 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-401000586 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-401000586| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-401000586| ~z$r_buff0_thd0~0_In-401000586)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-401000586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-401000586} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-401000586, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-401000586|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-401000586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:17:18,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1415430184 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1415430184 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1415430184 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1415430184 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-1415430184| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1415430184| ~z$r_buff1_thd0~0_In-1415430184) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1415430184, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1415430184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1415430184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1415430184} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1415430184, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1415430184|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1415430184, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1415430184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1415430184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:17:18,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_80) (= v_~main$tmp_guard1~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_80 0) (= v_~x~0_31 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_122 |v_ULTIMATE.start_main_#t~ite40_46|) (= v_~__unbuffered_p1_EBX~0_41 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_41, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_80, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_122, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~x~0=v_~x~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:17:19,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:17:19 BasicIcfg [2019-12-27 02:17:19,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:17:19,079 INFO L168 Benchmark]: Toolchain (without parser) took 13239.90 ms. Allocated memory was 145.2 MB in the beginning and 559.9 MB in the end (delta: 414.7 MB). Free memory was 100.2 MB in the beginning and 345.2 MB in the end (delta: -245.1 MB). Peak memory consumption was 169.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,082 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 156.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.57 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,088 INFO L168 Benchmark]: Boogie Preprocessor took 47.42 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,089 INFO L168 Benchmark]: RCFGBuilder took 746.66 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,090 INFO L168 Benchmark]: TraceAbstraction took 11581.81 ms. Allocated memory was 202.4 MB in the beginning and 559.9 MB in the end (delta: 357.6 MB). Free memory was 107.4 MB in the beginning and 345.2 MB in the end (delta: -237.8 MB). Peak memory consumption was 119.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:17:19,099 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.46 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 156.5 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.57 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.42 ms. Allocated memory is still 202.4 MB. Free memory was 153.8 MB in the beginning and 151.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.66 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 107.4 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11581.81 ms. Allocated memory was 202.4 MB in the beginning and 559.9 MB in the end (delta: 357.6 MB). Free memory was 107.4 MB in the beginning and 345.2 MB in the end (delta: -237.8 MB). Peak memory consumption was 119.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 155 ProgramPointsBefore, 70 ProgramPointsAfterwards, 180 TransitionsBefore, 78 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 21 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 192 VarBasedMoverChecksNegative, 55 SemBasedMoverChecksPositive, 173 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39797 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L832] FCALL, FORK 0 pthread_create(&t883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L834] FCALL, FORK 0 pthread_create(&t884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1150 SDtfs, 1057 SDslu, 1842 SDs, 0 SdLazy, 687 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred 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: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 1689 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 46630 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...