/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:12:41,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:12:41,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:12:41,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:12:41,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:12:41,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:12:41,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:12:41,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:12:41,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:12:41,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:12:41,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:12:41,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:12:41,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:12:41,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:12:41,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:12:41,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:12:41,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:12:41,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:12:41,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:12:41,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:12:41,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:12:41,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:12:41,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:12:41,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:12:41,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:12:41,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:12:41,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:12:41,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:12:41,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:12:41,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:12:41,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:12:41,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:12:41,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:12:41,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:12:41,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:12:41,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:12:41,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:12:41,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:12:41,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:12:41,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:12:41,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:12:41,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:12:41,631 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:12:41,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:12:41,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:12:41,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:12:41,634 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:12:41,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:12:41,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:12:41,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:12:41,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:12:41,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:12:41,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:12:41,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:12:41,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:12:41,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:12:41,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:12:41,637 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:12:41,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:12:41,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:12:41,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:12:41,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:12:41,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:12:41,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:12:41,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:12:41,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:12:41,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:12:41,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:12:41,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:12:41,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:12:41,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:12:41,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:12:41,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:12:41,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:12:41,954 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:12:41,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:12:41,956 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:12:41,957 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 07:12:42,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14e518f8/24a99904a19144208450d25e4f50d3ad/FLAG89a2574fa [2019-12-27 07:12:42,566 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:12:42,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.opt.i [2019-12-27 07:12:42,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14e518f8/24a99904a19144208450d25e4f50d3ad/FLAG89a2574fa [2019-12-27 07:12:42,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14e518f8/24a99904a19144208450d25e4f50d3ad [2019-12-27 07:12:42,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:12:42,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:12:42,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:42,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:12:42,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:12:42,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:42" (1/1) ... [2019-12-27 07:12:42,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:42, skipping insertion in model container [2019-12-27 07:12:42,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:12:42" (1/1) ... [2019-12-27 07:12:42,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:12:42,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:12:43,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:43,514 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:12:43,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:12:43,650 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:12:43,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43 WrapperNode [2019-12-27 07:12:43,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:12:43,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:43,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:12:43,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:12:43,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:12:43,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:12:43,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:12:43,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:12:43,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (1/1) ... [2019-12-27 07:12:43,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:12:43,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:12:43,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:12:43,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:12:43,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (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 07:12:43,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:12:43,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:12:43,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:12:43,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:12:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:12:43,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:12:43,829 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:12:43,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:12:43,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:12:43,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:12:43,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:12:43,834 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 07:12:44,507 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:12:44,507 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:12:44,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:44 BoogieIcfgContainer [2019-12-27 07:12:44,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:12:44,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:12:44,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:12:44,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:12:44,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:12:42" (1/3) ... [2019-12-27 07:12:44,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd5706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:44, skipping insertion in model container [2019-12-27 07:12:44,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:12:43" (2/3) ... [2019-12-27 07:12:44,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afd5706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:12:44, skipping insertion in model container [2019-12-27 07:12:44,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:12:44" (3/3) ... [2019-12-27 07:12:44,517 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.opt.i [2019-12-27 07:12:44,528 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:12:44,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:12:44,536 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:12:44,538 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:12:44,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,577 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,621 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:12:44,662 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:12:44,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:12:44,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:12:44,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:12:44,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:12:44,681 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:12:44,681 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:12:44,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:12:44,681 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:12:44,697 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 07:12:44,699 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:44,786 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:44,786 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:44,799 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:44,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 07:12:44,862 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 07:12:44,863 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:12:44,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:12:44,883 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:12:44,884 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:12:47,849 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:12:47,961 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:12:48,050 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 07:12:48,050 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 07:12:48,054 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 07:12:48,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 07:12:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 07:12:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:12:48,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:48,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:12:48,597 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 07:12:48,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:48,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274302052] [2019-12-27 07:12:48,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:48,832 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 07:12:48,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274302052] [2019-12-27 07:12:48,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:48,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:48,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009876478] [2019-12-27 07:12:48,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:48,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:48,855 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 07:12:49,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:49,140 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 07:12:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:49,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:12:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:49,240 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 07:12:49,240 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 07:12:49,242 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 07:12:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 07:12:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 07:12:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 07:12:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 07:12:49,838 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 07:12:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:49,839 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 07:12:49,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 07:12:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:12:49,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:49,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:49,845 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:49,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 07:12:49,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:49,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809515412] [2019-12-27 07:12:49,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:49,999 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 07:12:50,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809515412] [2019-12-27 07:12:50,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:50,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:50,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125793142] [2019-12-27 07:12:50,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:50,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:50,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:50,003 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 07:12:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:50,454 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 07:12:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:50,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:12:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:50,523 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 07:12:50,523 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 07:12:50,524 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 07:12:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 07:12:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 07:12:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 07:12:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 07:12:51,599 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 07:12:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:51,600 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 07:12:51,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 07:12:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:12:51,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:51,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:51,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 07:12:51,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:51,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454519307] [2019-12-27 07:12:51,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:51,727 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 07:12:51,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454519307] [2019-12-27 07:12:51,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:51,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:51,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291294863] [2019-12-27 07:12:51,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:51,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:51,730 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 07:12:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:52,095 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 07:12:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:52,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:12:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:52,147 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 07:12:52,148 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 07:12:52,148 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 07:12:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 07:12:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 07:12:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 07:12:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 07:12:52,655 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 07:12:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:52,656 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 07:12:52,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 07:12:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:12:52,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:52,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:52,660 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:52,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:52,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 07:12:52,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:52,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598215578] [2019-12-27 07:12:52,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:52,714 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 07:12:52,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598215578] [2019-12-27 07:12:52,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:52,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:12:52,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006586156] [2019-12-27 07:12:52,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:52,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:52,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:52,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:52,716 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 07:12:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:52,779 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 07:12:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:52,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:12:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:52,825 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 07:12:52,825 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 07:12:52,826 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 07:12:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 07:12:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 07:12:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 07:12:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 07:12:53,436 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 07:12:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:53,436 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 07:12:53,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 07:12:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:53,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:53,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:53,442 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 07:12:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:53,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668973961] [2019-12-27 07:12:53,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:53,518 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 07:12:53,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668973961] [2019-12-27 07:12:53,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:53,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:53,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152798585] [2019-12-27 07:12:53,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:53,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:53,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:53,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:53,520 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 07:12:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:53,614 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 07:12:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:53,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:12:53,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:53,645 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 07:12:53,645 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 07:12:53,646 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 07:12:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 07:12:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 07:12:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 07:12:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 07:12:53,976 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 07:12:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:53,977 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 07:12:53,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 07:12:53,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:12:53,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:53,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:53,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:53,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 07:12:53,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:53,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376415370] [2019-12-27 07:12:53,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:54,664 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 07:12:54,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376415370] [2019-12-27 07:12:54,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:54,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:12:54,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150651759] [2019-12-27 07:12:54,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:12:54,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:54,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:12:54,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:12:54,667 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 4 states. [2019-12-27 07:12:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:54,701 INFO L93 Difference]: Finished difference Result 1920 states and 4675 transitions. [2019-12-27 07:12:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:12:54,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:12:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:54,705 INFO L225 Difference]: With dead ends: 1920 [2019-12-27 07:12:54,705 INFO L226 Difference]: Without dead ends: 1382 [2019-12-27 07:12:54,705 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 07:12:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-27 07:12:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2019-12-27 07:12:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-12-27 07:12:54,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3017 transitions. [2019-12-27 07:12:54,732 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3017 transitions. Word has length 17 [2019-12-27 07:12:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:54,732 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 3017 transitions. [2019-12-27 07:12:54,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:12:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3017 transitions. [2019-12-27 07:12:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:12:54,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:54,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:54,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 07:12:54,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:54,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146652657] [2019-12-27 07:12:54,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:54,867 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 07:12:54,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146652657] [2019-12-27 07:12:54,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:54,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:54,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777076123] [2019-12-27 07:12:54,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:54,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:54,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:54,870 INFO L87 Difference]: Start difference. First operand 1378 states and 3017 transitions. Second operand 6 states. [2019-12-27 07:12:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:55,446 INFO L93 Difference]: Finished difference Result 3860 states and 8328 transitions. [2019-12-27 07:12:55,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:55,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 07:12:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:55,453 INFO L225 Difference]: With dead ends: 3860 [2019-12-27 07:12:55,453 INFO L226 Difference]: Without dead ends: 3825 [2019-12-27 07:12:55,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:55,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-12-27 07:12:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2035. [2019-12-27 07:12:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 07:12:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4502 transitions. [2019-12-27 07:12:55,505 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4502 transitions. Word has length 25 [2019-12-27 07:12:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4502 transitions. [2019-12-27 07:12:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4502 transitions. [2019-12-27 07:12:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:12:55,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:55,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:55,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:55,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 07:12:55,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950992628] [2019-12-27 07:12:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:55,589 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 07:12:55,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950992628] [2019-12-27 07:12:55,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:55,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:55,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280396532] [2019-12-27 07:12:55,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:55,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:55,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:55,592 INFO L87 Difference]: Start difference. First operand 2035 states and 4502 transitions. Second operand 6 states. [2019-12-27 07:12:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:56,015 INFO L93 Difference]: Finished difference Result 3781 states and 8072 transitions. [2019-12-27 07:12:56,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:12:56,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 07:12:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:56,021 INFO L225 Difference]: With dead ends: 3781 [2019-12-27 07:12:56,022 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 07:12:56,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 07:12:56,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2007. [2019-12-27 07:12:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-27 07:12:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4455 transitions. [2019-12-27 07:12:56,071 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4455 transitions. Word has length 26 [2019-12-27 07:12:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:56,072 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4455 transitions. [2019-12-27 07:12:56,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4455 transitions. [2019-12-27 07:12:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 07:12:56,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:56,075 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] [2019-12-27 07:12:56,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:56,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1268776575, now seen corresponding path program 1 times [2019-12-27 07:12:56,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:56,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038408813] [2019-12-27 07:12:56,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:56,153 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 07:12:56,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038408813] [2019-12-27 07:12:56,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:56,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:12:56,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114649359] [2019-12-27 07:12:56,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:12:56,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:12:56,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:56,156 INFO L87 Difference]: Start difference. First operand 2007 states and 4455 transitions. Second operand 5 states. [2019-12-27 07:12:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:56,650 INFO L93 Difference]: Finished difference Result 3029 states and 6609 transitions. [2019-12-27 07:12:56,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:12:56,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 07:12:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:56,654 INFO L225 Difference]: With dead ends: 3029 [2019-12-27 07:12:56,654 INFO L226 Difference]: Without dead ends: 3029 [2019-12-27 07:12:56,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 07:12:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2019-12-27 07:12:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2592. [2019-12-27 07:12:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2592 states. [2019-12-27 07:12:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 5719 transitions. [2019-12-27 07:12:56,700 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 5719 transitions. Word has length 27 [2019-12-27 07:12:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:56,700 INFO L462 AbstractCegarLoop]: Abstraction has 2592 states and 5719 transitions. [2019-12-27 07:12:56,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:12:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 5719 transitions. [2019-12-27 07:12:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 07:12:56,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:56,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:56,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1084312717, now seen corresponding path program 1 times [2019-12-27 07:12:56,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:56,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614280245] [2019-12-27 07:12:56,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:12:56,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614280245] [2019-12-27 07:12:56,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:56,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:12:56,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561476319] [2019-12-27 07:12:56,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:12:56,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:56,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:12:56,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:12:56,830 INFO L87 Difference]: Start difference. First operand 2592 states and 5719 transitions. Second operand 5 states. [2019-12-27 07:12:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:56,879 INFO L93 Difference]: Finished difference Result 1572 states and 3294 transitions. [2019-12-27 07:12:56,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:12:56,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 07:12:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:56,881 INFO L225 Difference]: With dead ends: 1572 [2019-12-27 07:12:56,882 INFO L226 Difference]: Without dead ends: 1322 [2019-12-27 07:12:56,882 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 07:12:56,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-12-27 07:12:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1227. [2019-12-27 07:12:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-12-27 07:12:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2651 transitions. [2019-12-27 07:12:56,900 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2651 transitions. Word has length 28 [2019-12-27 07:12:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:56,901 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 2651 transitions. [2019-12-27 07:12:56,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:12:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2651 transitions. [2019-12-27 07:12:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:12:56,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:56,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:56,905 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1854307324, now seen corresponding path program 1 times [2019-12-27 07:12:56,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:56,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469843142] [2019-12-27 07:12:56,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:56,991 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 07:12:56,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469843142] [2019-12-27 07:12:56,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:56,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:12:56,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643413707] [2019-12-27 07:12:56,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:12:56,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:56,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:12:56,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:12:56,993 INFO L87 Difference]: Start difference. First operand 1227 states and 2651 transitions. Second operand 7 states. [2019-12-27 07:12:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:57,187 INFO L93 Difference]: Finished difference Result 2151 states and 4542 transitions. [2019-12-27 07:12:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:12:57,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 07:12:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:57,190 INFO L225 Difference]: With dead ends: 2151 [2019-12-27 07:12:57,190 INFO L226 Difference]: Without dead ends: 1444 [2019-12-27 07:12:57,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:12:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2019-12-27 07:12:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1235. [2019-12-27 07:12:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 07:12:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2642 transitions. [2019-12-27 07:12:57,209 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2642 transitions. Word has length 51 [2019-12-27 07:12:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:57,209 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2642 transitions. [2019-12-27 07:12:57,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:12:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2642 transitions. [2019-12-27 07:12:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:12:57,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:57,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:57,213 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1878935226, now seen corresponding path program 2 times [2019-12-27 07:12:57,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:57,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671408110] [2019-12-27 07:12:57,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:57,286 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 07:12:57,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671408110] [2019-12-27 07:12:57,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:57,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255676105] [2019-12-27 07:12:57,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:57,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:57,288 INFO L87 Difference]: Start difference. First operand 1235 states and 2642 transitions. Second operand 3 states. [2019-12-27 07:12:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:57,356 INFO L93 Difference]: Finished difference Result 1608 states and 3404 transitions. [2019-12-27 07:12:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:57,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:12:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:57,359 INFO L225 Difference]: With dead ends: 1608 [2019-12-27 07:12:57,359 INFO L226 Difference]: Without dead ends: 1608 [2019-12-27 07:12:57,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 07:12:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-12-27 07:12:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1283. [2019-12-27 07:12:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-27 07:12:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2754 transitions. [2019-12-27 07:12:57,381 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2754 transitions. Word has length 51 [2019-12-27 07:12:57,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:57,382 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2754 transitions. [2019-12-27 07:12:57,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:57,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2754 transitions. [2019-12-27 07:12:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:57,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:57,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:57,386 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:57,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:57,386 INFO L82 PathProgramCache]: Analyzing trace with hash 105545405, now seen corresponding path program 1 times [2019-12-27 07:12:57,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:57,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459098231] [2019-12-27 07:12:57,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:57,504 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 07:12:57,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459098231] [2019-12-27 07:12:57,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:57,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:12:57,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915099712] [2019-12-27 07:12:57,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:12:57,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:57,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:12:57,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:12:57,506 INFO L87 Difference]: Start difference. First operand 1283 states and 2754 transitions. Second operand 6 states. [2019-12-27 07:12:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:58,018 INFO L93 Difference]: Finished difference Result 1599 states and 3356 transitions. [2019-12-27 07:12:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:12:58,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 07:12:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:58,020 INFO L225 Difference]: With dead ends: 1599 [2019-12-27 07:12:58,021 INFO L226 Difference]: Without dead ends: 1599 [2019-12-27 07:12:58,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:12:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-12-27 07:12:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1271. [2019-12-27 07:12:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2019-12-27 07:12:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2720 transitions. [2019-12-27 07:12:58,041 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2720 transitions. Word has length 52 [2019-12-27 07:12:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:58,042 INFO L462 AbstractCegarLoop]: Abstraction has 1271 states and 2720 transitions. [2019-12-27 07:12:58,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:12:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2720 transitions. [2019-12-27 07:12:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:12:58,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:58,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:58,046 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash 926927619, now seen corresponding path program 2 times [2019-12-27 07:12:58,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:58,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612915802] [2019-12-27 07:12:58,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:12:58,124 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 07:12:58,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612915802] [2019-12-27 07:12:58,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:12:58,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:12:58,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828884860] [2019-12-27 07:12:58,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:12:58,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:12:58,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:12:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:12:58,127 INFO L87 Difference]: Start difference. First operand 1271 states and 2720 transitions. Second operand 3 states. [2019-12-27 07:12:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:12:58,139 INFO L93 Difference]: Finished difference Result 1270 states and 2718 transitions. [2019-12-27 07:12:58,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:12:58,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:12:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:12:58,141 INFO L225 Difference]: With dead ends: 1270 [2019-12-27 07:12:58,141 INFO L226 Difference]: Without dead ends: 1270 [2019-12-27 07:12:58,142 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 07:12:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-12-27 07:12:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 895. [2019-12-27 07:12:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-12-27 07:12:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1922 transitions. [2019-12-27 07:12:58,158 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1922 transitions. Word has length 52 [2019-12-27 07:12:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:12:58,158 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1922 transitions. [2019-12-27 07:12:58,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:12:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1922 transitions. [2019-12-27 07:12:58,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:12:58,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:12:58,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:12:58,161 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:12:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:12:58,162 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 07:12:58,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:12:58,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290181200] [2019-12-27 07:12:58,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:12:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:12:58,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:12:58,307 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:12:58,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22|)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1715~0.base_22| 1)) (= 0 v_~x$w_buff0~0_25) (= 0 |v_ULTIMATE.start_main_~#t1715~0.offset_17|) (= v_~y~0_15 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1715~0.base_22|) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$w_buff0_used~0_102) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_13 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| 4) |v_#length_13|) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1715~0.base_22|) |v_ULTIMATE.start_main_~#t1715~0.offset_17| 0))) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1715~0.offset=|v_ULTIMATE.start_main_~#t1715~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, ULTIMATE.start_main_~#t1715~0.base=|v_ULTIMATE.start_main_~#t1715~0.base_22|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1715~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1716~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1716~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1715~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:12:58,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:12:58,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1716~0.base_12| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1716~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1716~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1716~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1716~0.base_12|) |v_ULTIMATE.start_main_~#t1716~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1716~0.offset=|v_ULTIMATE.start_main_~#t1716~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1716~0.base=|v_ULTIMATE.start_main_~#t1716~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1716~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1716~0.base] because there is no mapped edge [2019-12-27 07:12:58,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1365086145 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1365086145 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1365086145| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1365086145 |P0Thread1of1ForFork0_#t~ite5_Out-1365086145|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1365086145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1365086145} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1365086145|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1365086145, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1365086145} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:12:58,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In326683853 256) 0))) (or (and (= ~x$w_buff0~0_In326683853 |P1Thread1of1ForFork1_#t~ite14_Out326683853|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In326683853 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In326683853 256)) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In326683853 256) 0)) (and (= (mod ~x$w_buff1_used~0_In326683853 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite14_Out326683853| |P1Thread1of1ForFork1_#t~ite15_Out326683853|)) (and (= ~x$w_buff0~0_In326683853 |P1Thread1of1ForFork1_#t~ite15_Out326683853|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In326683853| |P1Thread1of1ForFork1_#t~ite14_Out326683853|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In326683853, ~x$w_buff1_used~0=~x$w_buff1_used~0_In326683853, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In326683853, ~weak$$choice2~0=~weak$$choice2~0_In326683853, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In326683853, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In326683853|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In326683853} OutVars{~x$w_buff0~0=~x$w_buff0~0_In326683853, ~x$w_buff1_used~0=~x$w_buff1_used~0_In326683853, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In326683853, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out326683853|, ~weak$$choice2~0=~weak$$choice2~0_In326683853, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In326683853, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out326683853|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In326683853} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:12:58,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In738997719 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out738997719| |P1Thread1of1ForFork1_#t~ite17_Out738997719|) (= ~x$w_buff1~0_In738997719 |P1Thread1of1ForFork1_#t~ite17_Out738997719|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In738997719 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd2~0_In738997719 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In738997719 256)) (and (= 0 (mod ~x$w_buff1_used~0_In738997719 256)) .cse1)))) (and (= ~x$w_buff1~0_In738997719 |P1Thread1of1ForFork1_#t~ite18_Out738997719|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In738997719| |P1Thread1of1ForFork1_#t~ite17_Out738997719|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In738997719, ~x$w_buff1_used~0=~x$w_buff1_used~0_In738997719, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In738997719, ~weak$$choice2~0=~weak$$choice2~0_In738997719, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In738997719, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In738997719|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In738997719} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out738997719|, ~x$w_buff1~0=~x$w_buff1~0_In738997719, ~x$w_buff1_used~0=~x$w_buff1_used~0_In738997719, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In738997719, ~weak$$choice2~0=~weak$$choice2~0_In738997719, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In738997719, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out738997719|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In738997719} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 07:12:58,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-95994114 256)))) (or (and (not .cse0) (= ~x$w_buff0_used~0_In-95994114 |P1Thread1of1ForFork1_#t~ite21_Out-95994114|) (= |P1Thread1of1ForFork1_#t~ite20_In-95994114| |P1Thread1of1ForFork1_#t~ite20_Out-95994114|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-95994114| ~x$w_buff0_used~0_In-95994114) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-95994114 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In-95994114 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-95994114 256) 0) (and (= (mod ~x$w_buff1_used~0_In-95994114 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-95994114| |P1Thread1of1ForFork1_#t~ite21_Out-95994114|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-95994114|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-95994114, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-95994114, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-95994114, ~weak$$choice2~0=~weak$$choice2~0_In-95994114, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95994114} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-95994114|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-95994114, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-95994114, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-95994114|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-95994114, ~weak$$choice2~0=~weak$$choice2~0_In-95994114, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-95994114} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 07:12:58,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1548127054 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1548127054 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1548127054 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1548127054 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1548127054| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out1548127054| ~x$w_buff1_used~0_In1548127054) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1548127054, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1548127054, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1548127054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1548127054} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1548127054|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1548127054, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1548127054, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1548127054, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1548127054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:12:58,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1884187319 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1884187319 256) 0))) (or (and (= ~x$r_buff0_thd1~0_Out1884187319 ~x$r_buff0_thd1~0_In1884187319) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd1~0_Out1884187319 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1884187319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1884187319} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1884187319, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1884187319|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1884187319} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:12:58,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd1~0_In-1217025614 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1217025614 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1217025614 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1217025614 256) 0))) (or (and (= ~x$r_buff1_thd1~0_In-1217025614 |P0Thread1of1ForFork0_#t~ite8_Out-1217025614|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1217025614|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1217025614, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1217025614, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1217025614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217025614} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1217025614, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1217025614|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1217025614, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1217025614, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1217025614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:12:58,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:12:58,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:12:58,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-619080839 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-619080839| |P1Thread1of1ForFork1_#t~ite29_Out-619080839|) (= ~x$r_buff1_thd2~0_In-619080839 |P1Thread1of1ForFork1_#t~ite30_Out-619080839|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-619080839 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-619080839 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-619080839 256)) .cse1) (and (= (mod ~x$r_buff1_thd2~0_In-619080839 256) 0) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-619080839| |P1Thread1of1ForFork1_#t~ite30_Out-619080839|) (= |P1Thread1of1ForFork1_#t~ite29_Out-619080839| ~x$r_buff1_thd2~0_In-619080839)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-619080839|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-619080839, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619080839, ~weak$$choice2~0=~weak$$choice2~0_In-619080839, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619080839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619080839} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-619080839|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-619080839|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-619080839, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619080839, ~weak$$choice2~0=~weak$$choice2~0_In-619080839, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-619080839, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619080839} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 07:12:58,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:12:58,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In72401340 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In72401340 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In72401340 |P1Thread1of1ForFork1_#t~ite32_Out72401340|) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In72401340 |P1Thread1of1ForFork1_#t~ite32_Out72401340|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In72401340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In72401340, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In72401340, ~x~0=~x~0_In72401340} OutVars{~x$w_buff1~0=~x$w_buff1~0_In72401340, ~x$w_buff1_used~0=~x$w_buff1_used~0_In72401340, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In72401340, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out72401340|, ~x~0=~x~0_In72401340} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:12:58,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:12:58,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1700847899 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1700847899 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1700847899|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1700847899 |P1Thread1of1ForFork1_#t~ite34_Out1700847899|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700847899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700847899} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1700847899|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1700847899, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700847899} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:12:58,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-536000277 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-536000277 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-536000277 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-536000277 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-536000277 |P1Thread1of1ForFork1_#t~ite35_Out-536000277|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out-536000277| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-536000277, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-536000277, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-536000277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-536000277} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-536000277, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-536000277, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-536000277|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-536000277, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-536000277} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:12:58,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-670510810 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-670510810 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-670510810 |P1Thread1of1ForFork1_#t~ite36_Out-670510810|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-670510810|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-670510810, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-670510810} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-670510810, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-670510810|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-670510810} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:12:58,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In2055732519 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In2055732519 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2055732519 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2055732519 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out2055732519| ~x$r_buff1_thd2~0_In2055732519)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2055732519|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2055732519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2055732519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2055732519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2055732519} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2055732519, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2055732519, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2055732519, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2055732519|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2055732519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:58,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:12:58,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:12:58,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1555240137 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1555240137 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1555240137 |ULTIMATE.start_main_#t~ite40_Out-1555240137|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1555240137| ~x~0_In-1555240137) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1555240137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1555240137, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1555240137, ~x~0=~x~0_In-1555240137} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1555240137|, ~x$w_buff1~0=~x$w_buff1~0_In-1555240137, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1555240137, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1555240137, ~x~0=~x~0_In-1555240137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:12:58,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 07:12:58,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1497949920 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1497949920 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1497949920 |ULTIMATE.start_main_#t~ite42_Out-1497949920|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1497949920|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1497949920, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1497949920} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1497949920, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1497949920|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1497949920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:12:58,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1896205117 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In1896205117 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1896205117 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1896205117 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1896205117|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1896205117 |ULTIMATE.start_main_#t~ite43_Out1896205117|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1896205117, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1896205117, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1896205117, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1896205117} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1896205117, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1896205117, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1896205117|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1896205117, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1896205117} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:12:58,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1270529434 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1270529434 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1270529434|)) (and (= ~x$r_buff0_thd0~0_In-1270529434 |ULTIMATE.start_main_#t~ite44_Out-1270529434|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1270529434, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270529434} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1270529434, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1270529434|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270529434} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:12:58,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1605495669 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1605495669 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1605495669 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1605495669 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1605495669| ~x$r_buff1_thd0~0_In1605495669)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out1605495669| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1605495669, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605495669, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1605495669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605495669} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1605495669, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1605495669, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1605495669, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1605495669|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1605495669} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:12:58,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:12:58,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:12:58 BasicIcfg [2019-12-27 07:12:58,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:12:58,425 INFO L168 Benchmark]: Toolchain (without parser) took 15500.32 ms. Allocated memory was 142.1 MB in the beginning and 694.7 MB in the end (delta: 552.6 MB). Free memory was 101.3 MB in the beginning and 281.4 MB in the end (delta: -180.1 MB). Peak memory consumption was 372.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,425 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.1 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.46 ms. Allocated memory was 142.1 MB in the beginning and 203.4 MB in the end (delta: 61.3 MB). Free memory was 100.9 MB in the beginning and 157.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,428 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,428 INFO L168 Benchmark]: RCFGBuilder took 758.16 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,429 INFO L168 Benchmark]: TraceAbstraction took 13913.06 ms. Allocated memory was 203.4 MB in the beginning and 694.7 MB in the end (delta: 491.3 MB). Free memory was 108.5 MB in the beginning and 281.4 MB in the end (delta: -172.9 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. [2019-12-27 07:12:58,433 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.19 ms. Allocated memory is still 142.1 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.46 ms. Allocated memory was 142.1 MB in the beginning and 203.4 MB in the end (delta: 61.3 MB). Free memory was 100.9 MB in the beginning and 157.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 155.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.16 ms. Allocated memory is still 203.4 MB. Free memory was 153.2 MB in the beginning and 109.2 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13913.06 ms. Allocated memory was 203.4 MB in the beginning and 694.7 MB in the end (delta: 491.3 MB). Free memory was 108.5 MB in the beginning and 281.4 MB in the end (delta: -172.9 MB). Peak memory consumption was 318.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1715, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1716, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1888 SDtfs, 1884 SDslu, 3120 SDs, 0 SdLazy, 1954 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 8866 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 42060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...